FEMTO: Fast search of large sequence collections

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present FEMTO, a new system for indexing and searching large collections of sequence data. We used FEMTO to index and search three large collections, including one 182 GB collection. We compare the performance of FEMTO indexing and search with Bowtie and with Lucene, and we compare performance with indexes stored on hard disks and in flash memory. To our knowledge, we report on the first compressed suffix array storing more than 100 GB. Even for the largest collection, most searches completed in under 10 seconds. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Ferguson, M. P. (2012). FEMTO: Fast search of large sequence collections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7354 LNCS, pp. 208–219). https://doi.org/10.1007/978-3-642-31265-6_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free