The phrase "alphabetic sequence" is correct and usable in written English.
It can be used to refer to a series of letters arranged in the order of the alphabet.
Example: "The teacher asked the students to list the letters in an alphabetic sequence for the exercise."
Alternatives: "alphabetical order" or "letter sequence".
That is, when we produced ULAN in print, we had to choose one name form under which to enter each cluster in the printed alphabetic sequence.
Fleming had initially classified stellar spectra by letter in alphabetic sequence from A to Q, mainly according to the strength of their hydrogen spectral lines.
The values of the key are arranged in a sorting sequence that is dependent on the type of key involved: alphanumeric key values are usually sorted in alphabetic sequence, while other types may be sorted on the basis of similarity in class, such as books on a particular subject or flora of the same genus.
This article considers the central role of the alphabetic sequence in the conceptual writing movement, which has emerged as the dominant avant-garde in poetry in the past decade.
For Baldessari, the alphabetic sequence is a multivalent signifier; it is a stand-in for language more generally, and it is also a figurative manifestation of the sequential methodology behind arts education that had been in existence for [End Page 153] hundreds of years.
In part B, the patient is asked to draw lines to connect encircled numbers and letters in an alternating numeric and alphabetic sequence (i.e., 1-A 2-B, etc).
There are 24 Defense Department entities, each of which is assigned "a series of two-letter alphabetic sequences," Colonel Sieminski explains.
He prefers less puzzling titles for cases than the random, alphabetic sequences that look like they have been devised by an amateur cryptologist.
Results showed that, for both numerical and alphabetic sequences, the left IPS was activated when performing backward recitation, but not when performing forward recitation.
It is also demonstrated that (A−1)/A is a sharp minimum on the mean number of steps taken in adaptive walks on fitness landscapes of alphabetic sequences with one-mutation adjacency.
220, 241 247] that from a random initial point on a random fitness landscape of alphabetic sequences with one-mutation adjacency, chosen from a larger class of landscapes, no adaptive algorithm can arrive at a local optimum in fewer than on average e−1 steps.
