Merging of multi-string BWTs with applications

Bioinformatics

Volumn 30, Issue 24, 2014, Pages 3524-3531

  Holt, James ^a   McMillan, Leonard ^a  

^a Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; GENOMICS; HIGH THROUGHPUT SEQUENCING; INFORMATION PROCESSING; MOUSE; PROCEDURES; SEQUENCE ALIGNMENT;

ALGORITHMS; ANIMALS; DATA COMPRESSION; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; MICE; SEQUENCE ALIGNMENT;

EID: 84922709802     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu584     Document Type: Article

References (26)

1. Altschul, S. F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
2. Bauer, M. et al. (2011) Lightweight BWT Construction for Very Large String Collections. Comb. Pattern Matching, 6661, 219-231.
3. Bauer, MJ. et al. (2013) Lightweight algorithms for constructing and inverting the BWT of string collections. Theor. Comput. Sci., 483, 134-148.
4. Burrows, M. and Wheeler, D. (1994) A Block-Sorting Lossless Data Compression Algorithm.
5. Butler, J. et al. (2008) ALLPATHS: de novo assembly of whole-genome shotgun microreads. Genome Res., 18, 810820.
6. Cox, A. et al. (2012a) Large-scale compression of genomic sequence databases with the burrows-wheeler transform. Bioinformatics, 28, 1415-1419.
7. Cox, A. et al. (2012b) Comparing DNA sequence collections by direct comparison of compressed text indexes. In: Algorithms in Bioinformatics. Springer Berlin, Heidelberg, pp. 214-224.
8. Ferragina, P. et al. (2012) Lightweight data indexing and compression in external memory. Algorithmica, 63, 707-730.
9. Ferragina, P. and Manzini, G. (2001) An Experimental Study of an Opportunistic Index. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 269-278.
10. Janin, L. et al. (2014) Adaptive reference-free compression of sequence quality scores. Bioinformatics, 30, 24-30.
11. Kahn, S. (2011) On the future of genomic data. Science (Washington), 331, 728-729.
12. Kent, W. J. (2002) BLAT-the BLAST-like alignment tool. Genome Res., 12, 656-664.
13. Knuth, D. E. (1973) The Art of Computer Programming. Vol. 3, pp. 170-178.
14. Langmead, B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
15. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with burrowswheeler transform. Bioinformatics, 25, 1754-1760.
16. Loh, P. R. et al. (2012) Compressive genomics. Nat. Biotechnol., 30, 627-630.
17. Mantaci, S. et al. (2005) An extension of the burrows wheeler transform and applications to sequence comparison and data expression. Comb. Pattern Matching, 3537, 178-189.
18. Pevzner, P. et al. (2001) An Eulerian path approach to DNA fragment assembly. Proc. Natl Acad. Sci. USA, 98, 9748-9753.
19. Rasko, D. A. et al. (2008) The pangenome structure of Escherichia coli: comparative genomic analysis of E. coli commensal and pathogenic isolates. J. Bacteriol., 190, 6881-6893.
20. Robasky, K. et al. (2014) The role of replicates for error mitigation in next-generation sequencing. Nat. Rev. Genet., 15, 56-62.
21. Salikhov, K. et al. (2013) Using cascading Bloom filters to improve the memory usage for de Brujin graphs. In: Algorithms in Bioinformatics. Springer Berlin, Heidelberg, pp. 364-376.
22. Simpson, J. T. and Durbin, R (2010) Efficient construction of an assembly string graph using the FM-index. Bioinformatics, 26, i367-i373.
23. Simpson, J. T. and Durbin, R. (2012) Efficient de novo assembly of large genomes using compressed data structures. Genome Res., 22, 549-556.
24. Simpson, J. T. et al. (2009) ABySS: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
25. Sirén J. (2009) Compressed suffix arrays for massive data. In: String Processing and Information Retrieval. Springer, Berlin Heidelberg, pp. 63-74.
26. Zerbino, D. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Res., 18, 821-829.