Bloom filter Trie–A data structure for Pan-Genome storage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9289, Issue , 2015, Pages 217-230

  Holley, Guillaume ^a   Wittler, Roland ^a   Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DIGITAL STORAGE; GENES;

ALIGNMENT-FREE; BLOOM FILTERS; DE BRUIJN GRAPHS; HIGH-THROUGHPUT SEQUENCING; INCREMENTAL DATA; LARGE-SCALE PROJECTS; REFERENCE-FREE; STATE OF THE ART;

DATA STRUCTURES;

EID: 84947756843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-48221-6_16     Document Type: Conference Paper

References (22)

1. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Comm. ACM 13(7), 422–426 (1970)
2. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Digital SRC Research Report 124 (1994)
3. Chikhi, R., Medvedev, P.: Informed and automated k-mer size selection for genome assembly. Bioinformatics 30(1), 31–37 (2014)
4. Cox, A.J., Bauer, M.J., Jakobi, T., Rosone, G.: Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform. Bioinformatics 28(11), 1415–1419 (2012)
5. Crusoe, M., Edvenson, G., Fish, J., Howe, A., McDonald, E., Nahum, J., Nanlohy, K., Ortiz-Zuazaga, H., Pell, J., Simpson, J., Scott, C., Srinivasan, R.R., Zhang, Q., Brown, C.T.: The khmer software package: enabling efficient sequence analysis figshare (2014)
6. Deorowicz, S., Kokot, M., Grabowski, S., Debudaj-Grabysz, A.: KMC 2: Fast and resource-frugal k-mer counting. Bioinformatics 31(10), 1569–1576 (2015)
7. DePristo, M.A., Banks, E., Poplin, R., Garimella, K.V., Maguire, J.R., Hartl, C., Philippakis, A.A., del Angel, G., Rivas, M.A., Hanna, M., et al.: A framework for variation discovery and genotyping using next-generation DNA sequencing data. Nat. Genet. 43(5), 491–498 (2011)
8. Ernst, C., Rahmann, S.: PanCake: A data structure for pangenomes. In: Proceedings of the German Conference on Bioinformatics, vol. 34, pp. 35–45 (2013)
9. Ferragina, P., Manzini, G.: An experimental study of an opportunistic index. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, vol. 1, pp. 269–278 (2001)
10. Fredking, E.: Trie memory. Comm. ACM 3(9), 490–499 (1960)
11. Heinz, S., Zobel, J., Williams, H.E.: Burst tries: a fast, efficient data structure for string keys. ACM Trans. Inf. Syst. 20(2), 192–223 (2002)
12. Huang, L., Popic, V., Batzoglou, S.: Short read alignment with populations of genomes. Bioinformatics 29(13), i361–i370 (2013)
13. Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet. 44(2), 226–232 (2012)
14. Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25(14), 1754–1760 (2009)
15. Marçais, G., Kingsford, C.: A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27(6), 764–770 (2011)
16. Marcus, S., Lee, H., Schatz, M.C.: SplitMEM: a graphical algorithm for pangenome analysis with suffix skips. Bioinformatics 30(24), 3476–3483 (2014)
17. Myers, E.W.: The fragment assembly string graph. Bioinformatics 21, ii79–ii85 (2005)
18. Nguyen, N., Hickey, G., Zerbino, D.R., Raney, B., Earl, D., Armstrong, J., Haussler, D., Paten, B.: Building a pangenome reference for a population. J. Comput. Biol. 22(5), 387–401 (2015)
19. Paten, B., Diekhans, M., Earl, D., St John, J., Ma, J., Suh, B., Haussler, D.: Cactus graphs for genome comparisons. J. Comput. Biol. 18(3), 469–481 (2011)
20. Pell, J., Hintze, A., Canino-Koning, R., Howe, A., Tiedje, J.M., Brown, C.T.: Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc. Natl. Acad. Sci. USA 109(33), 13272–13277 (2012)
21. Solomon, B., Kingsford, C.: Large-Scale Search of Transcriptomic Read Sets with Sequence Bloom Trees. bioRxiv, 017087 (2015)
22. Wandelt, S., Starlinger, J., Bux, M., Leser, U.: RCSI: Scalable similarity search in thousand(s) of genomes. Proc. VLDB Endow. 6(13), 1534–1545 (2013)