From indexing data structures to de bruijn graphs

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

Volumn 8486 LNCS, Issue , 2014, Pages 89-99

  Cazaux, Bastien ^a   Lecroq, Thierry ^b   Rivals, Eric ^a  

^a UNIV MONTPELLIER   (France)

^b UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GENE ENCODING; PATTERN MATCHING;

DE BRUIJN GRAPH (DBG); DE BRUIJN GRAPHS; DNA ASSEMBLIES; DNA SEQUENCE ANALYSIS; LINEAR-TIME ALGORITHMS; SUB-STRINGS; SUFFIX-TREES; TRADITIONAL TECHNIQUES;

DATA STRUCTURES;

EID: 84958521641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07566-2_10     Document Type: Conference Paper

References (17)

1. Apostolico, A.: The myriad virtues of suffix trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO Advanced Science Institutes, Series F, vol. 12, pp. 85-96. Springer (1985
2. Bankevich, A., Nurk, S., Antipov, D., Gurevich, A.A., et al.: SPAdes: A new genome assembly algorithm and its applications to single-cell sequencing. Journal of Computational Biology 19(5), 455-477 (2012
3. Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn Graphs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol. 7534, pp. 225-235. Springer, Heidelberg (2012
4. Cazaux, B., Lecroq, T., Rivals, E.: From Indexing Data Structures to de Bruijn Graphs. Technical report, lirmm-00950983 (February 2014
5. Chikhi, R., Limasset, A., Jackman, S., Simpson, J., Medvedev, P.: On the representation of de Bruijn graphs. ArXiv e-prints (January 2014
6. Chikhi, R., Rizk, G.: Space-efficient and exact de Bruijn graph representation based on a Bloom filter. Algorithms for Molecular Biology 8, 22 (2013
7. Conway, T.C., Bromage, A.J.: Succinct data structures for assembling large genomes. Bioinformatics 27(4), 479-486 (2011
8. de Bruijn, N.: On bases for the set of integers. Publ. Math. Debrecen 1, 232-242 (1950
9. Gusfield, D.: Algorithms on strings, trees and sequences: Computer science and computational biology. Cambridge University Press, Cambridge (1997
10. Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993
11. Onodera, T., Sadakane, K., Shibuya, T.: Detecting superbubbles in assembly graphs. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 338-Springer, Heidelberg (2013
12. Pell, J., Hintze, A., Canino-Koning, R., Howe, A., Tiedje, J., Brown, C.: Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc. Natl Acad. Sci. USA 109(33), 13272-13277 (2012
13. Peng, Y., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler. In: Berger, B. (ed.) RECOMB 2010. LNCS, vol. 6044, pp. 426-440. Springer, Heidelberg (2010
14. Pevzner, P., Tang, H.,Waterman, M.: An Eulerian path approach to DNA fragment assembly. Proc. Natl Acad. Sci. USA 98(17), 9748-9753 (2001 (Pubitemid 32769375)
15. Rødland, E.A.: Compact representation of k-mer de Bruijn graphs for genome read assembly. BMC Bioinformatics 14, 313 (2013
16. Salmela, L.: Correction of sequencing errors in a mixed set of reads. Bioinformatics 26(10), 1284-1290 (2010
17. Simpson, J.T., Durbin, R.: Efficient construction of an assembly string graph using the FM-index. Bioinformatics 26(12), i367-i373 (2010.