- Methodology article
- Open Access

# A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes

- Stefan Kurtz†
^{1}, - Apurva Narechania†
^{2, 3}, - Joshua C Stein
^{2}and - Doreen Ware
^{2}Email author

**9**:517

https://doi.org/10.1186/1471-2164-9-517

© Kurtz et al; licensee BioMed Central Ltd. 2008

**Received:**21 July 2008**Accepted:**31 October 2008**Published:**31 October 2008

## Abstract

### Background

The challenges of accurate gene prediction and enumeration are further aggravated in large genomes that contain highly repetitive transposable elements (TEs). Yet TEs play a substantial role in genome evolution and are themselves an important subject of study. Repeat annotation, based on counting occurrences of *k*-mers, has been previously used to distinguish TEs from low-copy genic regions; but currently available software solutions are impractical due to high memory requirements or specialization for specific user-tasks.

### Results

Here we introduce the Tallymer software, a flexible and memory-efficient collection of programs for *k*-mer counting and indexing of large sequence sets. Unlike previous methods, Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the *k*-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set of whole genome shotgun sequences from maize (B73) (total size 10^{9} bp.). We analyzed *k*-mer frequencies for a wide range of *k*. At this low genome coverage (≈ 0.45×) highly repetitive 20-mers constituted 44% of the genome but represented only 1% of all possible *k*-mers. Similar low-complexity was seen in the repeat fractions of sorghum and rice. When applying our method to other maize data sets, High-*C*_{0}*t* derived sequences showed the greatest enrichment for low-copy sequences. Among annotated TEs, the most highly repetitive were of the Ty3/gypsy class of retrotransposons, followed by the Ty1/copia class, and DNA transposons. Among expressed sequence tags (EST), a notable fraction contained high-copy *k*-mers, suggesting that transposons are still active in maize. Retrotransposons in Mo17 and McC cultivars were readily detected using the B73 20-mer frequency index, indicating their conservation despite extensive rearrangement across cultivars. Among one hundred annotated bacterial artificial chromosomes (BACs), *k*-mer frequency could be used to detect transposon-encoded genes with 92% sensitivity, compared to 96% using alignment-based repeat masking, while both methods showed 92% specificity.

### Conclusion

The Tallymer software was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available. For more information on the software, see http://www.zbh.uni-hamburg.de/Tallymer.

## Keywords

- Transposable Element
- Lexicographic Order
- Space Requirement
- Suffix Array
- Occurrence Count

## Background

Repetitive elements abound in the genomes of higher organisms. Tandem repeats, simple sequence repeats, long terminal repeats (LTRs), segmental duplications, and transposable elements (TEs) are among those types commonly found in eukaryotic species. The biological role of these entities in genome evolution has been documented [1, 2], but from a computational standpoint, the frequency with which repetitive elements occur may confound gene finding and the alignment of homologous sequences.

For anticipated plant genome projects and those currently underway, effective and rapid annotation of their many repeats has acquired a new urgency. For example, the maize genome is estimated to be 60–70% repetitive, mainly in the form of retrotransposons that proliferated in the last 2 to 6 million years [3–5]. Extensive repeats in maize has required a BAC-by-BAC sequencing approach with finishing primarily focused on the unique space. In this context, computational methods designed to annotate unique sequences have become indispensable.

Repeat identification strategies fall under two broad categories: de novo detection and similarity-based detection. RepeatMasker [6], one of the most widely used computational tools in repeat analysis, employs the latter method and is therefore reliant on precompiled repeat databases specific to the genome in question. RepeatMasker is an essential annotation tool for organisms whose repeat content has been well characterized. However, for many novel genomes a specific repeat library is either nonexistent or insufficient.

De novo methods address many of these concerns. RECON [7] currently the dominant tool for de novo repeat detection, builds a set of repeat families through pairwise similarity, clustering and boundary calling. RECON and other de novo detection programs like REPuter [8], Vmatch [9], RepeatFinder [10], RepeatGluer [11], and PILER [12], are designed to generate a repeat library rather than to use one. But to define repeat families, these self-alignment approaches are best suited to genomes that have been assembled into sizable scaffolds. If sequence is not available at that depth or with that contiguity, de novo methods may prove inaccurate especially with respect to repeat boundaries.

Other more recent programs like ReAS [13] and RepeatScout [14] attempt to build repeat families around frequent *k*-mers. *K*-mer frequency based methods were originally used in whole genome shotgun assemblers [15–17] that omit reads containing frequent *k*-mers for the purposes of assembly. Programs like ReAS operate in an inverse fashion, using only high copy reads to seed a sophisticated repeat finding strategy. But these methods, like genome assemblers, require significant sequence depth to assure adequate coverage over repeat families. Though we propose a similar strategy, our goal is not to identify repeat families. We have found that even if available sequences cover only a fraction of the genome, *k*-mer frequencies alone capture rich statistical information on the repeat profiles of plant genomes.

Like other *k*-mer frequency approaches [18–20] our method does not require a precompiled repeat library. Rather than simple hashing methods (which only work for small values of *k*), we employ enhanced suffix arrays [21] to compute occurrence counts and construct an index (called *k*-mer frequency index) from which we can efficiently retrieve the frequency of each stored *k*-mer. This strategy allows us to process very large datasets for a wide variety of values of *k*, and to assign frequency annotations with unprecedented speed. We developed this method in the context of the Maize Genome Sequencing Project where rapid genome-scale frequency annotation is integral to genome finishing. The project employs a traditional BAC-by-BAC sequencing strategy, but directed sequence finishing will proceed only in those regions designated as unique with respect to a 0.45 × WGS data set generated by the Joint Genome Institute (see Section "Maize WGS data set"). During development of this novel finishing strategy we expanded *k*-mer frequencies into a powerful comparative genomics tool, highlighting the differences in complexity and overall repetitiveness in several grass genomes.

## Methods

### Sequence data sets

The different sequence sets used in the validation experiment.

class | fraction | abbrev. | size | source |
---|---|---|---|---|

WGS | Pilot Bacterial Artificial Chromosomes | BAC | 14.8 | [35] |

WGS | BAC End Sequences | BES | 8.0 | AGI [50] |

Repeat | Transposable Elements | RepI | 8.0 | MIPS [28] |

Repeat | DNA transposons | RepII | 0.1 | MIPS [28] |

GE | Expressed Sequence Clusters | EST | 56.3 | PlantGDB [51] |

GE | AZM4 High- | AZM4 HC | 188.8 | TIGR [52] |

GE | AZM4 Methyl-filtered | AZM4 MF | 156.8 | TIGR [52] |

GA | TIGR4 assembly of rice ( | Osj:TIGR4 | 420.0 | TIGR [37] |

GA | TAIR7 assembly of | At:TAIR7 | 115.4 | TAIR [42] |

GA | JGI1.1 assembly of poplar ( | Pt:JGI1.1 | 410.0 | [43] |

GA | Genoscope1 assembly of grapevine ( | Vc:GEN1 | 487.0 | [44] |

### Maize WGS data set

Whole-genome shotgun reads for Maize (*Zea mays L. ssp. mays*), generated by the Joint Genome Institute were downloaded from the NCBI Trace Archive on February 13, 2006 and clipped to remove vector sequences using cross match [25] and the NCBI UniVec database [26]. The resulting dataset, called maize 0.45 × WGS, included 1,124,441 reads and 1,088,525,270 nucleotides.

### Gene annotation

*Ab initio* gene prediction was conducted using FGE-NESH (monocot matrix) on non-masked BAC sequences. Resulting predictions were subjected to BLASTP against the NCBI non-redundant Gen-Pept database with the low-complexity filter turned on, and presumptive genes were identified as having an E-value ≤ 1*e*^{-5}. Transposable elements were screened out by matching their hits against a manually curated list of 2852 transposable element genes.

### Annotation of transposable elements

Transposable elements were identified using Repeat-Masker [6] and MIPS Repeat Element Database (mips-REdat) and Catalog (mips-REcat) [27, 28]. This database provides a hierarchical classification of plant transposable elements and other repeat types. Before use, the database was screened for non-TE related sequences and the following identifiers were removed: 'bsr1' (containing cytochrome P450 and hydrolase sequences), 'k_1' (containing proton-ATPase sequence), and 'magellan_cone' (containing myb transcription factor sequence).

Receiver operating characteristic (ROC) curves were compared by the method of [29], as implemented in the MedCalc^{®} statistical software package.

### Basic notions for sequence processing

We consider sequences over the DNA alphabet {A, C, G, T, N}, where N denotes an undetermined base (usually represented by one of the IUPAC characters *S*, *Y*, *W*, *R*, *K*, *V*, *B*, *D*, *H*, *M*, *N*). 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. mer_{
k
}(*v*) denotes the set of all different *k*-mers in *v*. For any set *M*, |*M*| denotes the number of elements in *M*. So |mer_{
k
}(*v*)| is the number of different *k*-mers in *v*. For any sequence *w* of length *k*, let *occ*(*w, v*) be the number of positions in *v* where *w* occurs. For a set *S* of sequences we define mer_{
k
}(*S*) = ∪_{v∈S}mer_{
k
}(*v*) and *occ*(*w*, *S*) = ∑_{v∈S}*occ*(*w, v*). That is, mer_{
k
}(*S*) is the set of different *k*-mers in all sequences from *S* and *occ*(*w, S*) is the number of positions in any sequence from *S* where *w* occurs.

### Occurrence ratios

*q*,

*q'*, 1 ≤

*q*≤

*q'*, the

*k*-mer occurrence ratio of

*S*is defined by

*ρ*

_{S, k}(

*q*,

*q'*) is the ratio of

*k*-mers occurring between

*q*and

*q'*times in

*S*.

*ρ*

_{S, k}(1, 1) is the

*k*-mer uniqueness ratio of

*S*, i.e. the ratio of

*k*-mers occurring exactly once in

*S*. We define the multiple occurrence ratio by

Note that the denominator in this fraction equals the number of all positions in *S* where a *k*-mer occurs. The nominator restricts this count to positions where the corresponding *k*-mer occurs between *q* and *q'* times. While the occurrence ratio only considers the number of different *k*-mers, the multiple occurrence ratio takes the number of occurrences of a *k*-mer into account. We want to compute *ρ*_{S, k}(*q*, *q'*) and ${\rho}_{S,k}^{\ast}$(*q*, *q'*) for a range of values of *k* and for any pair of values *q*, *q'*. We will later see how to do this efficiently.

### Average k-mer frequencies

*v*with respect to

*S*, denoted by

*λ*(

*k*,

*v*,

*S*), is defined by

That is, *C*(*k*, *v*, *S*) is the sum of the frequencies of all *k*-mers in *v* with respect to *S*. Note that *λ*(*k*, *v*, *S*) is large if the *k*-mers in *v* occur many times in *S*. It is small if the *k*-mers in *v* rarely occur in *S*. Thus the average frequency measures how often the *k*-mers of some sequence *v* occur on average in some reference sequence set. If *v* is of length *k*, then it contains exactly one *k*-mer, namely *v*, which implies *λ*(*k*, *v*, *S*) = log_{10}(*occ*(*v*, *S*) + 1).

### Distribution ratios

*k*-mer frequencies of the sequences they contain. The average

*k*-mer frequencies are determined relative to some reference sequence set

*S*(usually the 0.45 × WGS data set). To facilitate the comparison, we define non-overlapping subintervals of similar average

*k*-mer frequency and calculate the fraction of sequences that belong to that subinterval (i.e. they have similar average

*k*-mer frequency). As the sequence sets considerably differ in their size, we make these distributions comparable by computing ratios. To be precise, let

be the minimum and maximum possible *λ*-values for all sequences in the different sequence sets. We divide the interval [*λ*_{min}, *λ*_{max}] into equal sized non-overlapping subintervals at some suitable distance Δ. We obtain the intervals

[-*m* Δ, -(*m* - 1)Δ],[-(*m* - 1)Δ, -(*m* - 2)Δ],..., [(*n* - 2)Δ, (*n* - 1)Δ], [(*n* - 1)Δ, *n* Δ]

*λ*

_{min}= -

*m*Δ and (

*n*- 1)Δ ≤

*λ*

_{max}<

*n*Δ. Then for each integer

*j*∈ [-

*m*,

*n*- 1] we compute

where *λ* = *j* Δ. That is, Ω_{k, M}is the fraction of sequences in *M* falling into the *j* th subinterval. Ω_{k, M}is called *λ*-distribution ratio for *M*.

### Efficient computation of occurrence ratios

*k*-mers in

*S*. That is, it is derived from the distribution of

*occ*(

*w, S*) for all

*k*-mers

*w*in

*S*. Now let

*δ*

_{S, k}be a table such that for all

*i*≥ 1,

*δ*

_{S, k}[

*i*] is the number of different

*k*-mers occurring exactly

*i*times in

*S*. For example,

*δ*

_{S, k}[1] is the number of unique

*k*-mers in

*S*, i.e. the number of

*k*-mers occurring exactly once in

*S*. Then the following equations hold:

According to these equations we can efficiently compute *ρ*_{S, k}(*q*, *q'*) and ${\rho}_{S,k}^{\ast}$(*q*, *q'*) from table *δ*_{S, k}. To compute this, one needs to enumerate each *k*-mer with its occurrence count, thereby updating counters that were initialized to zero. That is, if a *k*-mer *w* with occurrence count *occ*(*w*, *S*) is enumerated, then one increments *δ*_{S, k}[*occ*(*w*, *S*)] by one.

Traditionally, occurrence counts for *k*-mers are computed by hashing methods. However, these only work, if the number 4^{
k
}of possible *k*-mers is considerably smaller than *n*. This does not hold for our application, where *k* ranges from 10 to 500. We have developed a different approach based on enhanced suffix arrays [21]. The space requirement and running time of our approach does not depend on the number of possible *k*-mers, but only on the total length of the sequences in *S*. Moreover, we can simultaneously compute *δ*_{S, k}[*occ*(*w*, *S*)] for a range of values of *k*. This is useful when determining the optimal value for *k*.

To explain our approach we begin with the concept of enhanced suffix arrays, as introduced in [21].

#### Enhanced suffix arrays

Suppose *S* consists of *r* sequences. To process *S* we concatenate all sequences in *S* into a long string denoted $\overline{S}$ with unique separator symbols $_{1},...,$_{r-1}between the *r* sequences. Additionally we add a sentinel character $*r* following the last sequence in the concatenation. Obviously, $\overline{S}$ contains exactly the same *k*-mers as *S*. That is, we can compute *k*-mer counts based on $\overline{S}$.

Suppose that $\overline{S}$ is of length *n* + 1. $\overline{S}$[*i*] denotes the character at position *i* in $\overline{S}$, for 0 ≤ *i* ≤ *n* - 1. For *i* ≤ *j*, $\overline{S}$[*i*..*j*] denotes the substring of *S* starting with the character at position *i* and ending with the character at position *j*. For *i* > *j*, $\overline{S}$[*i*..*j*] denotes the empty string. A substring of $\overline{S}$ beginning at the first position of $\overline{S}$ is a prefix of $\overline{S}$ and a substring ending at the last position of $\overline{S}$ is a suffix of $\overline{S}$. For each *h*, 0 ≤ *h* ≤ *n*, $\overline{S}$_{
h
}= $\overline{S}$[*h*..*n* - 1] denotes the *h*-th non-empty suffix of $\overline{S}$, i.e. the suffix beginning at position *h* in $\overline{S}$.

The key to our method is to lexicographically sort the suffixes of $\overline{S}$. Suppose that the characters are ordered such that A < C < G < T < N < $_{1} < ... <$_{
r
}. This character order induces an order on all nonempty suffixes of $\overline{S}$, which is captured in the suffix array. The suffix array suf of $\overline{S}$ is an array of integers in the range 1 to *n*, specifying the lexicographic order of the *n* + 1 non-empty suffixes of $\overline{S}$. In other words, ${\overline{S}}_{\text{suf}[0]},{\overline{S}}_{\text{suf}[1]},\mathrm{...}{\overline{S}}_{\text{suf}[n]}$ is the sequence of suffixes of $\overline{S}$ in ascending lexicographic order.

The lcp-table lcp is an array of integers in the range 0 to *n*. For each *h*, 1 ≤ *h* ≤ *n*, lcp[*h*] is the length of the longest common prefix of ${\overline{S}}_{\text{suf}[h-1]}$ and ${\overline{S}}_{\text{suf}[h]}$. Since = $_{
r
}is the largest suffix in the lexicographic order, ${\overline{S}}_{\text{suf}[n]}$ = $_{
r
}. Hence we always have lcp[*n*] = 0. In the following, the combination of the suffix array and the lcp-table is called enhanced suffix array.

The notion of lcp-intervals, introduced in [21] is central for the computation of the occurrence frequencies for the *k*-mers. An interval [*i*..*j*], 0 ≤ *i* <*j* ≤ *n*, is an lcp-interval of lcp-value ℓ if

1. lcp[*i*] < ℓ,

2. lcp[*h*] ≥ ℓ for all *h*, *i* + 1 ≤ *h* ≤ *j*,

3. *h* = 0 or lcp[*h*] = ℓ for at least one *h* satisfying *i* + 1 ≤ *h* ≤ *j*,

4. *j* = *n* or lcp[*j* + 1] < ℓ.

We will also use the shorthand ℓ-interval for an lcp-interval [*i*..*j*] of lcp-value ℓ. We say that an ℓ-interval [*i*..*j*] represents the substring $\overline{S}$[suf[*i*]..suf[*i*] + ℓ - 1] of $\overline{S}$ of length ℓ.

An interval [*i*..*i*], 0 ≤ *i* ≤ *n* is a singleton interval. We say that a singleton interval [*i*..*i*] represents the suffix $\overline{S}$[suf[*i*]..*n* - 1] of $\overline{S}$. An *m*-interval [*l*..*r*] is said to be embedded in an ℓ-interval [*i*..*j*] if it is a subinterval of [*i*..*j*] (i.e., *i* ≤ *l* <*r* ≤ *j*) and *m* > ℓ. Note that we cannot have both *i* = *l* and *r* = *j* because *m* > ℓ. A singleton interval [*l*..*l*] is said to be embedded in an ℓ-interval [*i*..*j*], if *i* ≤ *l* ≤ *j*. If an interval [*l*..*r*] is embedded in [*i*..*j*], then [*i*..*j*] is the interval enclosing [*l*..*r*]. If [*i*..*j*] encloses [*l*..*r*] and there is no interval embedded in [*i*..*j*] that also encloses [*l*..*r*], then [*l*..*r*] is called a child interval of [*i*..*j*].

#### Enumerating k-mers and their occurrence counts

The parent-child relationship of the intervals constitutes a conceptual (or virtual) tree which we call the lcp-interval tree of the suffix array. The leaves of the tree are the singleton intervals and the internal nodes of the tree are the lcp-intervals. In particular, the root of this tree is the 0-interval [0..*n*]. An important property of the lcp-interval tree is the fact that it implicitly stores the number of occurrences of all substrings of $\overline{S}$. In particular, an interval [*i*..*j*] represents a string occurring *j* - *i* + 1 times in $\overline{S}$. The idea is to read these occurrence counts from the lcp-interval tree. This works as follows: We use an algorithm described in [21] to enumerate the nodes of the lcp-interval tree. This algorithm has some important features:

(1) The nodes of the lcp-interval tree are enumerated in bottom-up order, i.e. a node, say *α*, is enumerated only after all nodes in the subtree below *α* have been enumerated.

(2) The children with the same parent node are enumerated according to the lexicographic order of the strings they represent.

(3) Whenever we process the children of a node, we have access to the lcp-value of the parent node.

(4) The values in tables suf and lcp are accessed in sequential order from left to right.

Due to property (2), the *k*-mers occurring in $\overline{S}$(represented by the intervals) are enumerated in lexicographic order. It now remains to show how to compute table *δ*_{S, k}for a range of values *k* between user defined limits *k*_{min} and *k*_{max}.

Suppose that all values incremented below are initialized to zero.

• We process a singleton interval [*i*..*i*] as follows: Let *d* be the lcp-value of the parent node of [*i*..*i*]. Then $\overline{S}$[suf[*i*]..suf[*i*] + *k* - 1] is a *k*-mer occurring exactly once in $\overline{S}$ if and only if the following holds:

1. *d* <*k*,

2. suf[*i*] + *k* ≤ *n*,

3. $\overline{S}$[suf[*i*]+*d*..suf[*i*] + *k* - 1] does not contain the symbol N.

As a consequence, for all *k*, max{*d* + 1, *k*_{min}} ≤ *k* ≤ min{*k'* - 1, *k*_{max}}, we increment *δ*_{S, k}[1] by one, where *k'* is the minimum value greater than *d* such that either suf[*i*] + *k'* = *n* or $\overline{S}$[suf[*i*] + *k'*] = N.

• We process an ℓ-interval [*i*..*j*] different from [0..*n*] as follows: Let *d* be the lcp-value of the parent of [*i*..*j*]. Then $\overline{S}$[suf[*j*]..suf[*j*] + *k* - 1] is a *k*-mer occurring *j* - *i* + 1 times in $\overline{S}$, if and only if *d* <*k* ≤ ℓ. As a consequence, for all *k*, max{*d* + 1, *k*_{min}} ≤ *k* ≤ min{ℓ, *k*_{max}}, we increment *δ*_{S, k}[*j* - *i* + 1] by one.

#### Analysis of time and space requirement

The suffix array can be computed in linear time and space (cf. [30]). The same holds for the lcp-table, see [31].

The algorithm to enumerate the lcp-intervals and singleton intervals, given the enhanced suffix array, runs in linear time, see [21] for details. Whenever one visits a node, say *α*, one keeps track of all nodes on the path from the root to *α*. These are maintained on a stack, using constant time and space per node. In our specific application, we store the lcp-value and the left interval boundary of each node on the stack. Since one has access to the lcp-value of the parent node (see property (3)), one can process each lcp-interval in constant time. For the singleton intervals we need to verify that $\overline{S}$[suf[*i*] + *d*..suf[*i*] + *k* - 1] does not contain the symbol N. Rather than checking this condition character by character, we use information about ranges of Ns, preprocessed from the input sequence. That is, we store, in sorted order, the first position of each run of consecutive Ns in $\overline{S}$. Then for each position *i*, 0 ≤ *i* ≤ *n* - 1, $\overline{S}$[*i*] ≠ N, we can determine the smallest position *i'* > *i* such that *i'* = *n* or $\overline{S}$[*i'*] = N using a binary search. Let *q* be the number of these runs. Then this method takes on the order of log_{2}*q* time and requires extra space proportional to *q*.

Due to property (4), the enhanced suffix array does not need to be represented in main memory. At any time, we only need to store two consecutive entries of table suf and lcp. Hence the space requirement is dominated by the stack needed for the bottom-up traversal of the (virtual) lcp-interval tree. Our specific application only requires to store nodes representing strings of length shorter than *k*_{max} occurring more than once as substrings in $\overline{S}$. Hence the stack size can be limited to *k*_{max}, which results in a space requirement proportional to *k*_{max}.

Besides random access to the sequence, we also need random access to a data structure for accumulating the occurrence counts. Let *τ* be the number of values *i* satisfying *δ*_{S, k}[*i*] > 0 for some *k* ∈ [*k*_{min}, *k*_{max}]. Then this data structure (e.g. hash table) requires space proportional to *τ* ≤ *n*.

The overall space requirement of the algorithm is proportional to *n* + *k*_{max} + *q* and the running time is proportional to *n* log_{2}*q*. While the running time does not depend on *k*_{max}, the space requirement is linearly dependent on *k*_{max}. Since *k*_{max} and *q* are both much smaller than *n*, they can be neglected. As a result, we obtain an algorithm that is linear in running time and space requirement. In contrast, the hashing methods run in time proportional to *n* + 4^{k} time and space proportional to 4^{k} for some fixed value of *k*. That is, their running time and space requirement grows exponentially with *k*. As a consequence, these methods can only be applied for small values of *k*. These values are fixed, in contrast to our method which allows the computation for a range of values of *k*.

#### Dividing and merging the datasets

The analysis above shows that the running time and space requirement of our algorithm for computing *k*-mer counts (for ranges of values of *k*) is dominated by the suffix array construction. This is especially true for the space requirement. To get an idea of whether our method can be applied to large sequence sets, we have to consider the space requirement of the suffix array constructions in more detail. The most space efficient suffix array construction requires (*n*⌈log_{2} *n*⌉)/8 bytes per input symbol plus 2*n*/8 bytes for representing the sequence. Given a 32-bit computer with 4 gigabytes (2^{32} - 1 bytes) of main memory, *n* has to satisfy the inequality (2*n* + *n*⌈log_{2} *n*⌉)/8 ≤ 2^{32} - 1. That is, the sequence length is limited to 1 gigabyte. Since we want to process considerably larger sequences, we developed a divide-and-conquer approach. This cuts the sequence $\overline{S}$ into sufficiently small non-overlapping sections, such that for each section we can compute the corresponding enhanced suffix array on a 32-bit computer (equipped with 4 gigabytes of main memory).

Processing each section by the algorithm described above results in occurrence counts for each section. More precisely, for each section we enumerate pairs (*occ, pos*) where *pos* is a position in the corresponding section and *occ* is the number of occurrences of $\overline{S}$ [*pos*..*pos* + *k* - 1] in this section. Thus each pair encodes a *k*-mer, and the pairs are stored on a file in the order they are delivered by the algorithm, namely in lexicographic order with respect to the *k*-mer. This property allows to combine the appropriate values in a merging process, which works as follows: Suppose we are given, say *m*, files storing the occurrence counts for the *m* sections of $\overline{S}$. These files are merged in *m* - 1 pairwise merge-operations. The merging steps only require to have the entire sequence $\overline{S}$ represented in main memory. Since we restrict to DNA sequences and, by construction, do not process any substrings of $\overline{S}$ containing the character N, we can store each nucleotide in 2 bits, i.e. *n*/4 bytes suffices for representing the sequence. That is, the merging procedure allows to process sequences of length up to 16 gigabytes on a 32-bit computer.

### Efficient computation of distribution ratios

In contrast to the occurrence ratios, the average frequency *λ*(*k*, *v*, *S*) of a sequence *v* is determined relative to the *k*-mer content of *S*. Since we want to compute *λ*(*k*, *v*, *S*) for a fixed set *S* and many different sequences *v*, it makes sense to preprocess *S* into a *k*-mer frequency index $\mathcal{I}$(*S*, *occ*_{min}, *occ*_{max}) storing all *k*-mers occurring between *occ*_{min} and *occ*_{max} times in *S*. Here *occ*_{min} and *occ*_{max} are user defined positive numbers. Constraining the indexed *k*-mers by user specified values *occ*_{min} and *occ*_{max} is relevant in applications where we are interested in *k*-mers occurring rarely (small value of *occ*_{max}) or frequently (large value of *occ*_{min}). Given the index $\mathcal{I}$(*S*, *occ*_{min}, *occ*_{max}), we want to solve the following tasks:

(1) For each possible sequence *w* of length *k*, determine if it occurs in the index.

(2) For each *k*-mer occurring in the index, determine the number of its occurrences in the index.

In the previous section we have shown how to compute occurrence ratios by enumerating *k*-mers. Instead of deriving occurrence ratios by incrementing some table *δ*_{S, k}, the same enumeration process can determine the *k*-mers *w* satisfying the constraint *occ*_{min} ≤ *occ*(*w, S*) ≤ *occ*_{max}. If this is satisfied, the *k*-mer is stored on a file. As the *k*-mers are enumerated in lexicographic order, the index $\mathcal{I}$(*S*, *occ*_{min}, *occ*_{max}) is simply a sequence of lexico-graphically ordered *k*-mers stored on a file. Whenever this is needed it can be mapped into main memory.

*S*,

*occ*

_{min},

*occ*

_{max}), we directly store each

*k*-mer together with the occurrence count, if this is required. As a

*k*-mer is a string over an alphabet of size 4, it can be stored in

*k*log

_{2}4 = 2

*k*bits. This, of course restricts the choice of

*k*to small values. But since the optimal values for

*k*are rather small (see Figure 1), this is not a restriction in practice.

Let *r* be the number of indexed *k*-mers. Since the stored *k*-mers are lexicographically ordered, for each possible *k*-mer, task (1) and (2) can be solved by a binary search over the index. Each step of the binary search requires to compare 2*k* bits. As these are represented by integers of the machine word size *ω*, a single comparison takes time proportional to $\lceil \frac{2k}{\omega}\rceil $. There are at most log_{2} *r* comparisons to determine if a *k*-mer occurs in the index. If it occurs, then the occurrence count can be determined in constant time by a single table lookup. Altogether, the search for a *k*-mer takes time proportional to $\lceil \frac{2k}{\omega}\rceil $ log_{2} *r*. For example, on a 32-bit computer, it takes on the order of 2 log_{2} *r* steps to perform the binary search when *k* = 20.

To put it together, our index differs in several aspects from other indexing approaches employed in sequence analysis (e.g. suffix trees [8], suffix arrays [32], or hash tables):

• First, we do not store information about where the *k*-mers occur in *S*. This fact leads to some simplifications for the implementation of the index and allows faster querying time. Moreover, it means that the size of the index is not dependent on the size of *S*. It rather depends on the choice of values *occ*_{min} and *occ*_{max}. For large sequence sets and larger values of *k*, the number of different *k*-mers becomes very large. When computing occurrence ratios, this is not a problem, as only *k*-mer counts are accumulated. However, when constructing the *k*-mer index, *occ*_{min} and *occ*_{max} should be chosen carefully. If these values are not restrictive enough, then there may be too many *k*-mers to be indexed. That is, the input sequence representation and the *k*-mer index may not fit into memory any more.

• Second, we directly store each *k*-mer as a bit string together with the occurrence count in the index. That is, the information about the indexed *k*-mer is not distributed over different memory locations, as in other indexing approaches (which usually store pointers into the original sequence). As a consequence, the querying times for our index are extremely short.

The Tallymer software [33] provides programs for computing occurrence ratios (*tallymer-occratio*), for generating a *k*-mer index (*tallymer-mkindex*), and for searching a *k*-mer index (*tallymer-search*). The software-distribution is complemented by a program to construct enhanced suffix arrays. The 32-bit version of this program can handle sequences of size about 150 million bp per gigabytes of main memory. For example, to handle the 0.45 × WGS data set (total length 1,088,525,270 bp.) in this amount of main memory, we have to split it into eight sections each of approximately 136 million bp. The program *tallymer-occratio* provides flexible options to specify the range of *k*-mer sizes considered and to tailor the values output. For example, one can specify that values are output as ratios instead of absolute counts. Comparison of *k*-mer frequencies of two sequence sets is not directly supported by the software, but can easily be done as follows: create an index of the first sequence set and query it with the second, and vice versa.

The program *tallymer-search* takes multiple fasta files as input. It generates all *k*-mers not containing any N from the given files, and matches them against the index in forward and/or reverse direction. Currently only exact matches are supported. An extension to degenerate matches would require a combination of index traversal and dynamic programming techniques, as, for example, implemented in Vmatch [9] for the case that the index is an enhanced suffix array.

## Results and discussion

### Selection of k-mer size for use in maize

Because our method allows us to compute *k*-mer frequencies for large values of *k*, we have a wide latitude for selection of a *k*-mer size. Figure 1 plots the *k*-mer uniqueness ratio for the 0.45 × WGS for *k* in the range 10 to 500. As *k* approaches 500, the curve reaches unity. The information content of the *k*-mer set increases at a very fast rate from *k* = 10 to *k* = 20. Beyond this point, increasing *k* does not significantly increase the number of unique *k*-mers, but does decrease the overall resolution of the *k*-mer set. The inflection point on this curve is likely to change for other genomes and other sources of survey sequence, but for our WGS reference, *k* = 20 is optimal.

### Validation of the 20-mer frequency index for the WGS set

The use of *k*-mer frequencies is premised on the availability of an unbiased sequence set reflecting the overall repeat character of the genome in question. To test whether the 0.45 × WGS meets this criterion, we computed the corresponding 20-mer frequency index, i.e. *S* is the 0.45 × WGS set and *k* = 20. It contains 456,445,768 different 20-mers. There are 1,041,350,089 positions at which a 20-mer occurs. We screened seven publicly available maize sequence sets (see Table 1), against *S*. That is, we evaluated Ω_{k, M}for *M* ∈ {BAC, BES, RepI, RepII, EST, AZM4 HC, AZM4 MF}.

The public maize sequence sets fall into three classes: (A) maize whole genome sequences, (B) maize repeats, and (c) maize gene enrichment sequences. The seven sequence sets are known to have differing degrees of repetitiveness and should therefore provide a means to verify our method. For example, we expect gene enriched sequence to be less repetitive than RepII sequences (DNA transposons), and RepII sequences to be less repetitive than RepI sequences (TEs).

^{-57})). Though the λ-distribution for RepII also appears to be bimodal, we were unable to find significantly different repeat populations among the DNA transposon derivatives and superfamilies.

Two repeat populations in the RepI sequence set. Repeat elements of the RepI set are found in different relative proportions depending on the repeat level tested (corresponding to peaks 1 and 2 in Figure 2B).

peak 1 | peak 2 | |||
---|---|---|---|---|

class | total | percentage | total | percentage |

unclassified | 66 | 11.0 | 1 | 0.3 |

LINE | 8 | 1.3 | 0 | 0 |

Ty1/copia | 142 | 23.6 | 292 | 75.5 |

Ty3/gypsy | 386 | 64.1 | 94 | 24.3 |

∑ 602 | ∑ 100.0 | ∑ 387 | ∑ 100.0 |

The three sequence sets delivered by gene enrichment methods shown in Figure 2C peak around an average frequency of 0 in the WGS set. The relative uniqueness of these reads justifies the attribute 'gene-enriched', but their apparent efficacy varies significantly. The High-*C*_{0}*t* method succeeds in concentrating unique sequence without much leakage of the highly repetitive content evident to some extent in the ESTs, and to a far greater extent in the methyl-filtered library. This difference observed between the High-*C*_{0}*t* and methyl-filtered libraries was previously observed in [34].

### Genome annotation using k-mer frequencies

*i*, in a BAC was masked if the logarithm of the absolute frequency of the 20-mer starting at position

*i*achieves some threshold. Figure 3A shows that, summing over all BACs, 50% of nucleotides were masked at an absolute frequency threshold of 1.3 or greater, corresponding to at least 20 occurrences in the WGS index. Coverage of individual BACs at this threshold ranged from 20.5% to 78.3%. Reducing the threshold resulted in greater coverage. At the lowest threshold of 0.3 (i.e. 2 or more copies), total coverage reached 70.1% (range for individual clones, 41.0–90.8%).

We compared these results to masking based on the curated MIPS REcat repeat library. This library includes repeats from many sources including annotated TEs from the BACs used in this analysis. Thus application of this library can be regarded as a 'gold-standard' for detection of TEs within these BACs. Indeed, masking using the MIPS REcat library, resulted in a total repeat coverage of 80.8% (range 36.8–100.0% on individual clones). This exceeds the masking rate of 67% originally reported for this set [35], suggesting that the MIPS REcat library has been updated with new repeat sequences after its publication in 2005. Figure 3B shows the extent of overlap between masked positions using these two methods. Overlap of positions masked by our method with curated TEs in REcat exceeded 93% at lowest absolute frequency threshold and reached a maximum of 99.85% over the most repetitive regions (threshold ≥ 4.00). Overlap was 98.51% at an absolute frequency threshold of 1.3. These results indicate that the MIPS REcat library is on the whole inclusive of moderately and highly repetitive regions in these BACs.

In contrast, 81% of the MIPS REcat-masked positions are also masked by our method. This was achieved at the absolute frequency threshold of 0.3 (Figure 3B). At the absolute frequency threshold of 1.3, only 61.2% of positions masked by MIPS REcat were also masked by our method.

We next compared the two repeat detection methods for their ability to discriminate TEs at the level of predicted genes. The set of 100 BACs were annotated using FGENESH and resulting predictions were classified as presumptive genes or as TEs using a similarity-based search (see Section "Methods"). Of the 2504 predicted genes, 359 (14%) were screened out as showing no evidence of homology to NCBI GenPept peptides. Of the remainder, 1842 (86%) were classified as TE while the remaining 303 (14%) were classified as presumptive genes. For these latter two classes the percent of coding sequence masked was calculated based on either RepeatMasker data or on constituent 20-mer frequencies at various thresholds. For each method of masking, receiver operating characteristic (ROC) curves were used to define a threshold of masking that best discriminated TEs from presumptive genes. Area under the curve (AUC), sensitivity, and specificity were used to compare efficacies [29].

*k*-mers depends on which absolute frequency threshold is used, we first optimized the threshold by comparing all ROC curves for absolute frequency thresholds between 0 and 4.0 at 0.1 increments. The threshold of 0.8 gave the maximum area under the curve (AUC), with a value of 0.961 (95% CI 0.952 to 0.969, p-value = 0.0001). For masking using REcat the AUC was only slightly higher, 0.962 (95% CI 0.953 to 0.969, p-value = 0.0001). Comparison of these two ROC curves, shown in Figure 4, revealed that this difference in AUC was not significant (p-value = 0.967).

*k*-mer frequencies as found within a low coverage whole genome shotgun sequence. Furthermore, the two methods showed a similar false-positive rate, each having specificity near 92%.

Discrimination of maize TE-encoded genes based on percent of coding sequence masked using either RepeatMasker (MIPS REcat library) or constituent 20-mer frequencies (WGS index with a threshold log repeat level of 0.8).

method | criterion | sensitivity | 95% CI | specificity | 95% CI |
---|---|---|---|---|---|

REcat | > 41.56 | 96.69 | 95.8–97.5 | 92.41 | 88.8–95.1 |

| > 17.00 | 92.62 | 91.3–93.8 | 92.08 | 88.4–94.9 |

While both RepeatMasker and our method masked the majority of RepI retroelements, some low copy TEs escaped masking under our method based on average frequencies. As shown in our analysis of the 100 pilot BACs, low-copy DNA transposons, may be annotated as such by curated repeat databases, but missed by the counting approach used here. In the context of directed sequence finishing, low-copy repeats are often as in need of characterization as protein coding genes. Leaving them unmasked in maize is actually in the best interests of the project. But the average frequency threshold must be chosen carefully: more permissive thresholds will lead to finishing TE-like elements, and more strict thresholds may mask high-copy gene families. To use this method optimally, a balance must be struck with respect to the genome in question, and the thresholds need to be adjusted according to the annotation requirements.

*k*-mer frequencies. In another set of experiments, we analyzed a 453 kb portion of maize chromosome 8 (assembled in-house as described in Section "Sequence data sets") and display a portion of its annotation from position 67,000 to 165,000 in Figure 5. The first two tracks show the locations of FGENESH

*ab initio*gene predictions classified as either putative protein-coding genes (blue) or transposable elements (red). The Global

*k*-mer Frequency (GKF) track visualizes the absolute frequency across the region. Frequencies in this histogram were generated by querying each overlapping 20-mer in a 5' to 3' direction against the WGS index. Note that some regions contain

*k*-mers occurring on the order of 1000 times in the maize WGS set. In the GKF track, TE-like genes often correspond to regions of high absolute frequency, while genes similar to known proteins reside in regions of smaller absolute frequencies.

If the scope of the experiment is narrowed, however, and the *k*-mer frequencies are computed with respect to the region itself, independent of the WGS index, a significantly different picture emerges. The Local *k*-mer Frequency (LKF) track represents a self-analysis: the frequencies of overlapping 20-mers in the query are determined relative to the 453 kb region alone. Even in a local context many TEs are present at high copy number (the LKF track also shows values on a logarithmic scale). But the LKF highlights local features in a way GKF cannot. This region contains four locally duplicated genes related to Selenium-binding proteins. Figure 5 shows that these genes have a higher LKF than surrounding genes that are present at single copy. Such peaks are not evident in the GKF track indicating that these genes have low overall copy number within the genome. This analysis could be employed to identify local expansions of paralogous genes commonly found in plant genomes [36].

### Comparative genomics

*k*-mer frequencies to annotate sequence with copy-number information, we have found that the frequency information contained therein are themselves biologically informative, illuminating cross species differences in repetitive content. For example, Figure 6 compares whole genome shotgun sets acquired from three distinct sequencing projects: rice [37], sorghum [38], and the 0.45 × maize set (JGI) employed throughout this analysis. Using randomly selected reads to simulate 0.45 × coverage in each species given their predicted genome sizes [39–41], we computed (multiple) occurrence ratios, i.e. percentage values 100·${\rho}_{S,k}^{\ast}$(1, 10) and 100·${\rho}_{S,k}^{\ast}$(11, 100) (Figure 6A) and 100·

*ρ*

_{S, k}(1, 10), 100·

*ρ*

_{S, k}(11, 100), 100·

*ρ*

_{S, k}(101, 1000), 100·

*ρ*

_{S, k}(1001, 10000), 100·

*ρ*

_{S, k}(10001, ∞) (Figure 6B), where

*k*= 20 and

*S*is the respective sequence set. Recall that the occurrence ratio

*ρ*

_{S, k}(

*q*,

*q'*) is the ratio of

*k*-mers occurring between

*q*and

*q'*times in

*S*. The multiple occurrence ratio ${\rho}_{S,k}^{\ast}$(

*q*,

*q'*) is similarly defined, but takes the number of occurrences of a

*k*-mer into account. See section "Methods" for details.

For example, in the case of maize, there are 1,041,350,089 positions at which a 20 mer occurs. There are 456,445,768 different 20-mers of which 378,556,535 are found only once, while the most highly represented sequences exists 47,933 times.

The multiple occurrence ratios represented in Figure 6A show that maize contains the most repetitive sequence, followed by sorghum, and rice. Nearly 25% of maize 20-mers occur more than 100 times while only 14% of sorghum and 13% of rice 20-mers exhibit this frequency. This finding was expected. When only considering the number of different 20-mers in Figure 6B, we find that a mere 1% of all 20-mers occurs more than 10 times, i.e. accounts for the repetitive fractions. This is a remarkable equivalence in complexity across the three organisms. Low complexity is consistent with relatively recent proliferation of a small number of originating TE's resulting in limited divergence of *k*-mers. Maize demonstrates the most substantial growth in repetitive content, a finding attributable to its known TE expansion [3–5]. Thus, the *k*-mer frequency method provides a novel way of quantifying this important evolutionary event.

*k*-mer sizes greater than 50 base pairs impractical. However, genome assemblies obviously do not suffer from these read length restrictions. Currently, there are very few plant assemblies. Though a number of projects are underway, only four genomes have been published: arabidopsis [42], rice [37, 40], poplar [43], and grapevine [44]. In Figure 7 we plot the

*k*-mer uniqueness ratio for these genomes, as a function of

*k*. We tested

*k*-mer sizes from

*k*= 10 to

*k*= 500. With

*k*approaching 500, the uniqueness ratio converges to 1. More repetitive genomes such as rice and poplar converge at a much slower rate than arabidopsis.

*k*-mer frequencies cannot be used to annotate repeats across species (data not shown) owing to divergent TE families. But within a species, our method seems to work across cultivars regardless of which subtype is considered. For maize, our standard 0.45 × WGS sequence set is derived from B73, the cultivar currently being sequenced. Figure 8 shows that using this index, one can successfully mask the TEs of two sister cultivars, McC and Mo17, in the well-characterized Bronze-1 locus [45]. While the transposition histories of the three cultivars differ markedly, the

*k*-mers in these TEs have undergone little divergence.

## Conclusion

We have described a method based on *k*-mer frequencies allowing for annotating large repetitive plant genomes. As we have demonstrated, our method is useful as an alternative or supplementary form of repeat annotation in novel genomes. The novelty of genomes being sequenced is precisely the reason why this approach has value. By definition, new genomes lack comprehensive repeat libraries, and the construction of de novo libraries is often hampered by the paucity of sequence available at a project's outset. In the absence of such libraries, survey sequences in the form of Sanger WGS, 454 [46], Solexa [47], or SOLID [48] reads can be used to create cheap, abbreviated *k*-mer frequency indices for use across multiple subtypes.

In designing the *k*-mer frequency approach to be completely independent of any manual annotation, we apply a binary decision framework: given a numerical threshold, sequence is designated as either repeat or non-repeat. Though binary designations are sufficient for sequence masking, we believe that the *k*-mer frequencies (and measures we derive from it) are best used in combination with other methods designed for careful repeat annotation as demonstrated in the accompanying publication [49].

To apply our methods to large sequence sets, we have developed fast and memory efficient algorithms to compute occurrence ratios, to index *k*-mers, and to retrieve their occurrence counts from the index. The algorithms are implemented in the Tallymer software. A distribution of the software and the Perl-scripts post processing the output is available from the Tallymer website [33].

## Notes

## Declarations

### Acknowledgements

The authors wish to thank Dick McCombie, Melissa Kramer, and Lidia Nascimento of the DNA Sequencing Facility at Cold Spring Harbor Laboratory (CSHL) for sequencing, assembly, and GenBank submission of the four newly-sequenced maize BACs described here. We thank the Maize Genome Sequencing Consortium for useful discussion, preliminary analysis and beta-testing of the software. We thank Shiran Pasternak (CSHL) and Ute Willhoeft (Center for Bioinformatics) for helpful discussions and critical reading of previous versions of the manuscript. We also thank Peter VanBuren (CSHL) for system management. The individuals were supported by the following grants, JS NSF DBI-0738000, AN NSF DBI-0527192, DW USDA ARS. We want to thank anonymous reviewers for suggestions to improve previous versions of the manuscript.

## Authors’ Affiliations

## References

- Doolittle WF, Sapienza C: Selfish genes, the phenotype paradigm and genome evolution. Nature. 1980, 284 (5757): 601-3. 10.1038/284601a0.View ArticleGoogle Scholar
- Orgel LE, Crick FH: Selfish DNA: the ultimate parasite. Nature. 1980, 284 (5757): 604-7. 10.1038/284604a0.View ArticleGoogle Scholar
- SanMiguel P, Gaut BS, Tikhonov A, Nakajima Y, Bennetzen JL: The paleontology of intergene retro-transposons of maize. Nat Genet. 1998, 20: 43-5. 10.1038/1695.View ArticleGoogle Scholar
- SanMiguel PJ, Ramakrishna W, Bennetzen JL, Busso CS, Dubcovsky J: Transposable elements, genes and recombination in a 215-kb contig from wheat chromosome 5A(m). Funct Integr Genomics. 2002, 2 (1–2): 70-80. 10.1007/s10142-002-0056-4.View ArticleGoogle Scholar
- Sanz-Alferez S, SanMiguel P, Jin YK, Springer PS, Bennetzen JL: Structure and evolution of the Cinful retrotransposon family of maize. Genome. 2003, 46 (5): 745-52. 10.1139/g03-061.View ArticleGoogle Scholar
- Smit A, Hubley R, Green P: RepeatMasker Open-3.0. 1996, [http://www.repeatmasker.org]Google Scholar
- Bao Z, Eddy SR: Automated de novo identification of repeat sequence families in sequenced genomes. Genome Res. 2002, 12 (8): 1269-76. 10.1101/gr.88502.PubMed CentralView ArticleGoogle Scholar
- Kurtz S, Choudhuri J, Ohlebusch E, Schleiermacher C, Stoye J, Giegerich R: REPuter: The Manifold Applications of Repeat Analysis on a Genomic Scale. Nucleic Acids Res. 2001, 29 (22): 4633-4642. 10.1093/nar/29.22.4633.PubMed CentralView ArticleGoogle Scholar
- The Vmatch large scale sequence analysis software. [http://www.vmatch.de]
- Volfovsky N, Haas BJ, Salzberg SL: A clustering method for repeat analysis in DNA sequences. Genome Biol. 2001, 2 (8): RESEARCH0027-10.1186/gb-2001-2-8-research0027.PubMed CentralView ArticleGoogle Scholar
- Pevzner PA, Tang H, Tesler G: De novo repeat classification and fragment assembly. Genome Res. 2004, 14 (9): 1786-96. 10.1101/gr.2395204.PubMed CentralView ArticleGoogle Scholar
- Edgar RC, Myers EW: PILER: identification and classification of genomic repeats. Bioinformatics. 2005, 21 (Suppl 1): i152-8. 10.1093/bioinformatics/bti1003.View ArticleGoogle Scholar
- Li R, Ye J, Li S, Wang J, Han Y, Ye C, Wang J, Yang H, Yu J, Wong GK, Wang J: ReAS: Recovery of Ancestral Sequences for Transposable Elements from the Unassembled Reads of a Whole Genome Shotgun. PLoS Comput Biol. 2005, 1 (4): e43-10.1371/journal.pcbi.0010043.PubMed CentralView ArticleGoogle Scholar
- Price AL, Jones NC, Pevzner PA: De novo identification of repeat families in large genomes. Bioinformatics. 2005, 21 (Suppl 1): i351-8. 10.1093/bioinformatics/bti1018.View ArticleGoogle Scholar
- Sutton G, White O, Adams M, Kerlavage A: TIGR Assembler: a new tool for assembling large shotgun sequencing projects. Genome Sci Technol. 1995, 1: 9-19.View ArticleGoogle Scholar
- Huson DH, Reinert K, Kravitz SA, Remington KA, Delcher AL, Dew IM, Flanigan M, Halpern AL, Lai Z, Mobarry CM, Sutton GG, Myers EW: Design of a compartmentalized shotgun assembler for the human genome. Bioinformatics. 2001, 17 (Suppl 1): S132-9.View ArticleGoogle Scholar
- Yu J, Hu S, Wang J, Wong GK, Li S, Liu B, Deng Y, Dai L, Zhou Y, Zhang X, Cao M, Liu J, Sun J, Tang J, Chen Y, Huang X, Lin W, Ye C, Tong W, Cong L, Geng J, Han Y, Li L, Li W, Hu G, Huang X, Li W, Li J, Liu Z, Li L, Liu J, Qi Q, Liu J, Li L, Li T, Wang X, Lu H, Wu T, Zhu M, Ni P, Han H, Dong W, Ren X, Feng X, Cui P, Li X, Wang H, Xu X, Zhai W, Xu Z, Zhang J, He S, Zhang J, Xu J, Zhang K, Zheng X, Dong J, Zeng W, Tao L, Ye J, Tan J, Ren X, Chen X, He J, Liu D, Tian W, Tian C, Xia H, Bao Q, Li G, Gao H, Cao T, Wang J, Zhao W, Li P, Chen W, Wang X, Zhang Y, Hu J, Wang J, Liu S, Yang J, Zhang G, Xiong Y, Li Z, Mao L, Zhou C, Zhu Z, Chen R, Hao B, Zheng W, Chen S, Guo W, Li G, Liu S, Tao M, Wang J, Zhu L, Yuan L, Yang H: A draft sequence of the rice genome (
*Oryza sativa L. ssp. indica*). Science. 2002, 296 (5565): 79-92. 10.1126/science.1068037.View ArticleGoogle Scholar - Healy J, Thomas EE, Schwartz JT, Wigler M: Annotating large genomes with exact word matches. Genome Res. 2003, 13 (10): 2306-15. 10.1101/gr.1350803.PubMed CentralView ArticleGoogle Scholar
- Lefebvre A, Lecroq T, Dauchel H, Alexandre J: FORRepeats: detects repeats on entire chromosomes and between genomes. Bioinformatics. 2003, 19 (3): 319-26. 10.1093/bioinformatics/btf843.View ArticleGoogle Scholar
- Campagna D, Romualdi C, Vitulo N, Del Favero M, Lexa M, Cannata N, Valle G: RAP: a new computer program for de novo identification of repeated sequences in whole genomes. Bioinformatics. 2005, 21 (5): 582-8. 10.1093/bioinformatics/bti039.View ArticleGoogle Scholar
- Abouelhoda M, Kurtz S, Ohlebusch E: Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms. 2004, 2: 53-86. 10.1016/S1570-8667(03)00065-0.View ArticleGoogle Scholar
- Coe E, Cone K, McMullen M, Chen SS, Davis G, Gardiner J, Liscum E, Polacco M, Paterson A, Sanchez-Villeda H, Soderlund C, Wing R: Access to the maize genome: an integrated physical and genetic map. Plant Physiol. 2002, 128: 9-12. 10.1104/pp.010953.PubMed CentralView ArticleGoogle Scholar
- Nelson WM, Bharti AK, Butler E, Wei F, Fuks G, Kim H, Wing RA, Messing J, Soderlund C: Whole-genome validation of high-information-content fingerprinting. Plant Physiol. 2005, 139: 27-38. 10.1104/pp.105.061978.PubMed CentralView ArticleGoogle Scholar
- Gao M, Li G, Yang B, McCombie W, Quiros C: Comparative analysis of a Brassica BAC clone containing several major aliphatic glucosinolate genes with its corresponding Arabidopsis sequence. Genome. 2004, 47 (4): 666-679. 10.1139/g04-021.View ArticleGoogle Scholar
- Laboratory of Phil Green. [http://www.phrap.Org]
- VecScreen. [http://www.ncbi.nlm.nih.gov/VecScreen/UniVec.html]
- MIPS Repeat Element Database (mips-REdat) and Catalog (mips-REcat). [http://mips.gsf.de/proj/plant/webapp/recat/]
- Spannagl M, Noubibou O, Haase D, Yang L, Gundlach H, Hindemitt T, Klee K, Haberer G, Schoof H, Mayer KF: MIPSPlantsDB-plant database resource for integrative and comparative plant genome research. Nucleic Acids Res. 2007, D834-40. 10.1093/nar/gkl945. 35 DatabaseGoogle Scholar
- Hanley JA, McNeil BJ: A method of comparing the areas under receiver operating characteristic curves derived from the same cases. Radiology. 1983, 148 (3): 839-43.View ArticleGoogle Scholar
- Käkkäinen J, Sanders P, Burkhardt S: Linear work suffix array construction. Journal of the ACM. 2006, 53 (6): 1-19.Google Scholar
- Kasai T, Lee G, Arimura H, Arikawa S, Park K: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and its Applications. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. 2001, Lecture Notes in Computer Science 2089, Springer-Verlag, 181-192.View ArticleGoogle Scholar
- Manber U, Myers E: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing. 1993, 22 (5): 935-948. 10.1137/0222058.View ArticleGoogle Scholar
- Tallymer: a collection of flexible and memory-efficient programs for
*k*-mer counting and indexing of large sequence sets. [http://www.zbh.uni-hamburg.de/Tallymer] - Whitelaw CA, Barbazuk WB, Pertea G, Chan AP, Cheung F, Lee Y, Zheng L, van Heeringen S, Karamycheva S, Bennetzen JL, SanMiguel P, Lakey N, Bedell J, Yuan Y, Budiman MA, Resnick A, Van Aken S, Utterback T, Riedmuller S, Williams M, Feldblyum T, Schubert K, Beachy R, Fraser CM, Quackenbush J: Enrichment of Gene-Coding Sequences in Maize by Genome Filtration. Science. 302 (5653): 2118-2120. 10.1126/science.1090047.Google Scholar
- Haberer G, Young S, Bharti AK, Gundlach H, Raymond C, Fuks G, Butler E, Wing RA, Rounsley S, Birren B, Nusbaum C, Mayer KF, Messing J: Structure and architecture of the maize genome. Plant Physiol. 2005, 139 (4): 1612-24. 10.1104/pp.105.068718.PubMed CentralView ArticleGoogle Scholar
- Rizzon C, Ponger L, Gaut B: Striking similarities in the genomic distribution of tandemly arrayed genes in Arabidopsis and rice. PLoS Comput Biol. 2006, 2 (9): e115-10.1371/journal.pcbi.0020115.PubMed CentralView ArticleGoogle Scholar
- Goff SA, Ricke D, Lan TH, Presting G, Wang R, Dunn M, Glazebrook J, Sessions A, Oeller P, Varma H, Hadley D, Hutchison D, Martin C, Katagiri F, Lange BM, Moughamer T, Xia Y, Budworth P, Zhong J, Miguel T, Paszkowski U, Zhang S, Colbert M, Sun WL, Chen L, Cooper B, Park S, Wood TC, Mao L, Quail P, Wing R, Dean R, Yu Y, Zharkikh A, Shen R, Sahasrabudhe S, Thomas A, Cannings R, Gutin A, Pruss D, Reid J, Tavtigian S, Mitchell J, Eldredge G, Scholl T, Miller RM, Bhatnagar S, Adey N, Rubano T, Tusneem N, Robinson R, Feldhaus J, Macalma T, Oliphant A, Briggs S: A draft sequence of the rice genome (
*Oryza sativa L. ssp. japonica*). Science. 2002, 296 (5565): 92-100. 10.1126/science.1068275.View ArticleGoogle Scholar - Sorghum bicolor v1.0. [http://www.jgi.doe.gov/sorghum]
- Rayburn A, Biradar D, Bullock D, McMurphy L: Nuclear DNA content in F1 hybrids of maize. Heredity. 1993, 70: 294300-10.1038/hdy.1993.42.View ArticleGoogle Scholar
- International Rice Genome Sequencing Project: The map-based sequence of the rice genome. Nature. 2005, 436 (7052): 793-800. 10.1038/nature03895.View ArticleGoogle Scholar
- Price HJ, Dillon SL, Hodnett G, Rooney WL, Ross L, Johnston JS: Genome evolution in the genus Sorghum (Poaceae). Ann Bot (Lond). 2005, 95: 219-27. 10.1093/aob/mci015.View ArticleGoogle Scholar
- Arabidopsis Genome Initiative: Analysis of the genome sequence of the flowering plant Arabidopsis thaliana. Nature. 2000, 408 (6814): 796-815. 10.1038/35048692.View ArticleGoogle Scholar
- Tuskan GA, Difazio S, Jansson S, Bohlmann J, Grigoriev I, Hellsten U, Putnam N, Ralph S, Rombauts S, Salamov A, Schein J, Sterck L, Aerts A, Bhalerao RR, Bhalerao RP, Blaudez D, Boerjan W, Brun A, Brunner A, Busov V, Campbell M, Carlson J, Chalot M, Chapman J, Chen GL, Cooper D, Coutinho PM, Couturier J, Covert S, Cronk Q, Cunningham R, Davis J, Degroeve S, Dejardin A, Depamphilis C, Detter J, Dirks B, Dubchak I, Duplessis S, Ehlting J, Ellis B, Gendler K, Goodstein D, Gribskov M, Grimwood J, Groover A, Gunter L, Hamberger B, Heinze B, Helariutta Y, Henrissat B, Holligan D, Holt R, Huang W, Islam-Faridi N, Jones S, Jones-Rhoades M, Jorgensen R, Joshi C, Kangasjarvi J, Karlsson J, Kelleher C, Kirkpatrick R, Kirst M, Kohler A, Kalluri U, Larimer F, Leebens-Mack J, Leple JC, Locascio P, Lou Y, Lucas S, Martin F, Montanini B, Napoli C, Nelson DR, Nelson C, Nieminen K, Nilsson O, Pereda V, Peter G, Philippe R, Pilate G, Poliakov A, Razumovskaya J, Richardson P, Rinaldi C, Ritland K, Rouze P, Ryaboy D, Schmutz J, Schrader J, Segerman B, Shin H, Siddiqui A, Sterky F, Terry A, Tsai CJ, Uberbacher E, Unneberg P, Vahala J, Wall K, Wessler S, Yang G, Yin T, Douglas C, Marra M, Sandberg G, Peer Van de Y, Rokhsar D: The genome of black cottonwood,
*Populus trichocarpa*(Torr. & Gray). Science. 2006, 313 (5793): 1596-604. 10.1126/science.1128691.View ArticleGoogle Scholar - Jaillon O, Aury JM, Noel B, Policriti A, Clepet C, Casagrande A, Choisne N, Aubourg S, Vitulo N, Jubin C, Vezzi F, Legeai A, Hugueney P, Dasilva C, Horner D, Mica E, Jublot D, Poulain J, Bruyere C, Billault A, Segurens B, Gouyvenoux M, Ugarte E, Cattonaro F, Anthouard V, Vico V, Del Fabbro C, Alaux M, Di Gaspero G, Dumas V, Felice N, Paillard S, Juman I, Moroldo M, Scalabrin S, Canaguier A, Le Clainche I, Malacrida G, Durand E, Pesole G, Laucou V, Chatelet P, Merdinoglu D, Delledonne M, Pezzotti M, Lecharny A, Scarpelli C, Artiguenave F, Pe M, Valle G, Morgante M, Caboche M, Adam-Blondon AF, Weissenbach J, Quetier F, Wincker P, for The French-Italian Public Consortium for Grapevine Genome Characterization: The grapevine genome sequence suggests ancestral hexaploidization in major angiosperm phyla. characteristic curves derived from the same cases. Nature. 2007, 449 (7161): 463-467. 10.1038/nature06148.View ArticleGoogle Scholar
- Lai J, Li Y, Messing J, Dooner HK: Gene movement by Helitron transposons contributes to the haplotype variability of maize. Proc Natl Acad Sci USA. 2005, 102 (25): 9068-73. 10.1073/pnas.0502923102.PubMed CentralView ArticleGoogle Scholar
- Margulies M, Egholm M, Altman WE, Attiya S, Bader JS, Bemben LA, Berka J, Braverman MS, Chen YJ, Chen Z, Dewell SB, Du L, Fierro JM, Gomes XV, Godwin BC, He W, Helgesen S, Ho CH, Irzyk GP, Jando SC, Alenquer ML, Jarvie TP, Jirage KB, Kim JB, Knight JR, Lanza JR, Leamon JH, Lefkowitz SM, Lei M, Li J, Lohman KL, Lu H, Makhijani VB, McDade KE, McKenna MP, Myers EW, Nickerson E, Nobile JR, Plant R, Puc BP, Ronan MT, Roth GT, Sarkis GJ, Simons JF, Simpson JW, Srinivasan M, Tartaro KR, Tomasz A, Vogt KA, Volkmer GA, Wang SH, Wang Y, Weiner MP, Yu P, Begley RF, Rothberg JM: Genome sequencing in microfabricated high-density picolitre reactors. Nature. 2005, 437 (7057): 376-80.PubMed CentralGoogle Scholar
- Bentley DR: Whole-genome resequencing. Curr Opin Genet Dev. 2006, 16 (6): 545-52. 10.1016/j.gde.2006.10.009.View ArticleGoogle Scholar
- Mardis E: The impact of next-generation sequencing technology on genetics. Trends Genet. 2008, 24 (3): 133-41.View ArticleGoogle Scholar
- Wicker T, Narechania A, Sabot F, Stein J, Giang V, Graner A, Ware D, Stein N: Low-pass shotgun sequencing of the barley genome facilitates rapid identification of genes, conserved non-coding sequences and novel repeats. BMC Genomics. 2008, 9 (1): 518-10.1186/1471-2164-9-518.PubMed CentralView ArticleGoogle Scholar
- Arizona Genomics Institute. [http://www.genome.arizona.edu]
- Dong Q, Schlueter S, Brendel V: PlantGDB, plant genome database and analysis tools. Nucleic Acids Res. 2004, D354-9. 10.1093/nar/gkh046. 32 DatabaseGoogle Scholar
- Chan AP, Pertea G, Cheung F, Lee D, Zheng L, Whitelaw C, Pontaroli AC, SanMiguel P, Yuan Y, Bennetzen J, Barbazuk WB, Quackenbush J, Rabinowicz PD: The TIGR Maize Database. Nucleic Acids Res. 2006, D771-6. 10.1093/nar/gkj072. 34 DatabaseGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.