CoMeta: Classification of Metagenomes Using <i>k</i>-mers

<div><p>Nowadays, the study of environmental samples has been developing rapidly. Characterization of the environment composition broadens the knowledge about the relationship between species composition and environmental conditions. An important element of extracting the knowledge of the sample composition is to compare the extracted fragments of DNA with sequences derived from known organisms. In the presented paper, we introduce an algorithm called CoMeta (<u>C</u>lassification <u>o</u>f <u>meta</u>genomes), which assigns a query read (a DNA fragment) into one of the groups previously prepared by the user. Typically, this is one of the taxonomic rank (e.g., phylum, genus), however prepared groups may contain sequences having various functions. In CoMeta, we used the exact method for read classification using short subsequences (<i>k</i>-mers) and fast program for indexing large set of <i>k</i>-mers. In contrast to the most popular methods based on BLAST, where the query is compared with each reference sequence, we begin the classification from the top of the taxonomy tree to reduce the number of comparisons. The presented experimental study confirms that CoMeta outperforms other programs used in this context. CoMeta is available at <a href="https://github.com/jkawulok/cometa" target="_blank">https://github.com/jkawulok/cometa</a> under a free GNU GPL 2 license.</p>