Querying large read collections in main memory: A versatile data structure

BMC Bioinformatics

Volumn 12, Issue , 2011, Pages

  Philippe, Nicolas ^a,b   Salson, Mikaël ^c,d   Lecroq, Thierry ^c   Léonard, Martine ^c   Commes, Thérèse ^b   Rivals, Eric ^a  

^a LIRMM   (France)

^b Centre National de la Recherche Scientifique   (France)

^c UNIVERSITÉ DE ROUEN   (France)

^d INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC SOLUTIONS; BIOINFORMATIC ANALYSIS; BURROWS WHEELER TRANSFORM; HIGH-THROUGHPUT SEQUENCING; INDEXING STRUCTURES; INNOVATIVE PROGRAMS; TRANSCRIPTOME ANALYSIS; TRANSCRIPTOMICS;

ALGORITHMS; BIOINFORMATICS; DATA STRUCTURES; GENES; MAPPING; QUERY PROCESSING;

INDEXING (OF INFORMATION);

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER; COMPUTER PROGRAM; HIGH THROUGHPUT SEQUENCING; HUMAN; METHODOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTERS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SOFTWARE;

EID: 79958851554     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-12-242     Document Type: Article

References (32)

1. Maher C, Kumar-Sinha C, Cao X, Kalyana-Sundaram S, Han B, Jing X, Sam L, Barrette T, Palanisamy N, Chinnaiyan A. Transcriptome sequencing to detect gene fusions in cancer. Nature 2009, 458(7234):97-101. 10.1038/nature07638, 2725402, 19136943.
2. Blow N. Transcriptomics: The digital generation. Nature 2009, 458:239-242. 10.1038/458239a, 19279641.
3. Altschul S, Gish W, Miller W, Myers E, Lipman D. Basic local alignment search tool. J Mol Biol 1990, 215:403-410.
4. Burkhardt S, Crauser A, Ferragina P, Lenhof HP, Rivals E, Vingron M. q-gram Based Database Searching Using a Suffix Array (QUASAR). 3rd Annual Int Conf on Computational Molecular Biology 1999, 77-83. ACM Press.
5. Ferragina P, Manzini G. Opportunistic data structures with applications. Proc of FOCS 2000, 390-398.
6. Hach F, Hormozdiari F, Alkan C, Hormozdiari F, Birol I, Eichler E, Sahinalp S. mrsFAST: a cache-oblivious algorithm for short-read mapping. Nat Methods 2010, 7(8):576-577. 10.1038/nmeth0810-576, 3115707, 20676076.
7. Weiner P. Linear Pattern Matching Algorithms. Conf Record of the 14th Annual Symposium on Swithcing and Automata Theory 1973,
8. Manber U, Myers GW. Suffix Arrays: A New Method for On-Line String Searches. Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms 1990, 319-327. San-Francisco: SIAM.
9. Gusfield D. Algorithms on Strings, Trees and Sequences 1997, Cambridge University Press.
10. Shi F. Suffix Arrays for Multiple Strings: A Method for On-Line Multiple String Searches. ASIAN, Volume 1179 of Lecture Notes in Computer Science 1996, 11-22. Springer, Jaffar J, Yap RHC.
11. Ferragina P, González R, Navarro G, Venturini R. Compressed text indexes: From theory to practice. J Experimental Algorithmics 2009, 13:12:1.12-12:1.31.
12. Li H, Durbin R. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 2009, 25(14):1754-1760. 10.1093/bioinformatics/btp324, 2705234, 19451168.
13. Homann R, Fleer D, Giegerich R, Rehmsmeier M. mkESA: enhanced suffix array construction tool. Bioinformatics 2009, 25(8):1084-1085. 10.1093/bioinformatics/btp112, 2666816, 19246510.
14. Philippe N, Boureux A, Tarhio J, Bréhélin L, Commes T, Rivals E. Using reads to annotate the genome: influence of length, background distribution, and sequence errors on prediction capacity. Nucleic Acids Res 2009, 37(15):e104. 10.1093/nar/gkp492, 2731892, 19531739.
15. Salmela L. Correction of sequencing errors in a mixed set of reads. Bioinformatics 2010, 26(10):1284-1290. 10.1093/bioinformatics/btq151, 20378555.
16. Denoeud F, Aury JM, Da Silva C, Noel B, Rogier O, Delledonne M, Morgante M, Valle G, Wincker P, Scarpelli C, Jaillon O, Artiguenave F. Annotating genomes with massive-scale RNA sequencing. Genome Biol 2008, 9(12):R175. 10.1186/gb-2008-9-12-r175, 2646279, 19087247.
17. Trapnell C, Williams BA, Pertea G, Mortazavi A, Kwan G, van Baren MJ, Salzberg SL, Wold BJ, Pachter L. Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation. Nat Biotech 2010, 28(5):511-515.
18. Miller JR, Koren S, Sutton G. Assembly algorithms for next-generation sequencing data. Genomics 2010, 95(6):315-327. 10.1016/j.ygeno.2010.03.001, 2874646, 20211242.
19. Conway TC, Bromage AJ. Succinct Data Structures for Assembling Large Genomes. Bioinformatics 2011, 27(4):479-486. 10.1093/bioinformatics/btq697, 21245053.
20. Marcais G, Kingsford C. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 2011, 27(6):764-770. 10.1093/bioinformatics/btr011, 21217122.
21. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to Algorithms 2001, MIT Press, 2.
22. Munro I. Tables. Proc. of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Volume 1180 of Lecture Notes in Computer Science, Springer 1996, 37-42.
23. Raman R, Raman V, Rao S. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. Proc of Symposium on Discrete Algorithms (SODA) 2002, 233-242.
24. Manzini G. Two Space Saving Tricks for Linear Time LCP Array Computation. Proc 9th Scandinavian Workshop on Algorithm Theory 2004, 3111:372-383.
25. Kurtz S, Phillippy A, Delcher A, Smoot M, Shumway M, Antonescu C, Salzberg S. Versatile and open software for comparing large genomes. Genome Biol 2004, 5(2):R12. 10.1186/gb-2004-5-2-r12, 395750, 14759262.
26. Kasai T, Lee G, Arimura H, Arikawa S, Park K. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. Proc of the 12th Symposium on Combinatorial Pattern Matching, Volume 2089 of Lecture Notes in Computer Science, Springer 2001, 181-192.
27. Puglisi SJ, Smyth WF, Turpin A. A taxonomy of suffix array construction algorithms. ACM Comp Surv 2007, 39(2):1-31.
28. Schuster SC, Miller W, Ratan A, Tomsho LP, Giardine B, Kasson LR, Harris RS, Petersen DC, Zhao F, Qi J, Alkan C, Kidd JM, Sun Y, Drautz DI, Bouffard P, Muzny DM, Reid JG, Nazareth LV, Wang Q, Burhans R, Riemer C, Wittekindt NE, Moorjani P, Tindall EA, Danko CG, Teo WS, Buboltz AM, Zhang Z, Ma Q, Oosthuysen A, Steenkamp AW, Oostuisen H, Venter P, Gajewski J, Zhang Y, Pugh BF, Makova KD, Nekrutenko A, Mardis ER, Patterson N, Pringle TH, Chiaromonte F, Mullikin JC, Eichler EE, Hardison RC, Gibbs RA, Harkins TT, Hayes VM. Complete Khoisan and Bantu genomes from southern Africa. Nature 2010, 463(7283):943-947. 10.1038/nature08795, 20164927.
29. Li H, Homer N. A survey of sequence alignment algorithms for next-generation sequencing. Brief Bioinf 2010, 11(5):473-483.
30. Schröder J, Schröder H, Puglisi SJ, Sinha R, Schmidt B. SHREC: a short-read error correction method. Bioinformatics 2009, 25(17):2157-2163. 10.1093/bioinformatics/btp379, 19542152.
31. Ilie L, Fazayeli F, Ilie S. HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics 2011, 27(3):295-302. 10.1093/bioinformatics/btq653, 21115437.
32. Salmela L, Schröder J. Correcting errors in short reads by multiple alignments. Bioinformatics 2011, 27(11):1455-1461. 10.1093/bioinformatics/btr170, 21471014.