A string S is a sequence of characters over Σ.
Monomer labels that start with a '#' character followed by a sequence of characters (first non-digit).
The non-terminal string denotes a sequence of characters.
The space required by a sparse suffix array of a sequence of length n characters is O((n/ D) log(n/ D)).
In this way, we obtain a sequence of words whose length is at least one character and separated by a single blank.
Hence, a sequence of length t contains characters.
On the other hand, the total number of distinct words of any length found in a sequence of L characters can be Θ(L).
For fixed length k > 0, a k-mer is a sequence of length k, only containing the characters A, C, G, and T. Let v be some sequence.
For a sequence S∈ Σ ℓ and 0< i≤ ℓ, S[ i] denotes the i-th character of S. A pattern of length ℓ is a word P∈{0,1} ℓ, i.e. a sequence over {0,1} of length ℓ.
Each instance is then represented by a sequence of m sized vectors with length l, where m is the alphabet size and l is the length of the character sequences.
The sequences of the 39 accessions of the P. amabilis complex were aligned, with a sequence length of 908 characters (http://dx.doi.org/10.5061/dryad.org/10.5061/dryad
