Memory efficient minimum substring partitioning

Proceedings of the VLDB Endowment

Volumn 6, Issue 3, 2013, Pages 169-180

  Li, Yang ^a   Kamousi, Pegah ^a   Han, Fangqiu ^a   Yang, Shengqi ^a   Yan, Xifeng ^a   Suri, Subhash ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA SEQUENCES; GENE ENCODING; LARGE DATASET; MAMMALS;

ASSEMBLY ALGORITHM; DE BRUIJN GRAPHS; DE NOVO ASSEMBLIES; DISJOINT PARTITION; MASSIVELY PARALLELS; MEMORY EFFICIENT; MEMORY FOOTPRINT; PARTITION METHODS;

GRAPH ALGORITHMS;

EID: 84875090157     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2535569.2448951     Document Type: Article

References (26)

1. http://www.appliedbiosystems.com.
2. http://www.illumina.com.
3. M. Bilenko and R. Mooney. Adaptive duplicate detection using learnable string similarity measures. In KDD, pages 39-48, 2003.
4. D. Bitton and D. DeWitt. Duplicate record elimination in large data files. ACM Trans. Database Syst., 8:255-265, 1983.
5. J. Butler, I. MacCallum, M. Kleber, I. Shlyakhter, M. Belmonte, E. Lander, C. Nusbaum, and D. Jaffe. Allpaths: de novo assembly of whole-genome shotgun microreads. Genome Research, 18(5):810-820, 2008.
6. T. Conway and A. Bromage. Succinct data structures for assembling large genomes. Bioinformatics, 27(4):479-486, 2011.
7. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms (2nd ed.). MIT Press, 2001.
8. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. TKDE, 19:1-16, 2007.
9. P. Ferragina and G. Manzini. Indexing compressed text. Journal of the ACM (JACM), 52(4):552-581, 2005.
10. R. Karp and M. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
11. V. Kundeti, S. R. S, H. Dinh, M. Vaughn, and V. Thapar. Efficient parallel and out of core algorithms for constructing large bi-directed de bruijn graphs. BMC Bioinformaticse, 11:560, 2010.
12. R. Li, H. Zhu, J. Ruan, W. Qian, X. Fang, Z. Shi, Y. Li, S. Li, G. Shan, K. Kristiansen, et al. De novo assembly of human genomes with massively parallel short read sequencing. Genome research, 20(2):265-272, 2010.
13. E. Mardis. Next-generation dna sequencing methods. Annu. Rev. Genomics Hum. Genet., 9:387-402, 2008.
14. A. Metwally, D. Agrawal, and A. E. Abbadi. Duplicate detection in click streams. In WWW, pages 12-21, 2005.
15. J. Miller, S. Koren, and G. Sutton. Assembly algorithms for next-generation sequencing data. Genomics, 95(6):315-327, 2010.
16. E. Myers. The fragment assembly string graph. Bioinformatics, 21(suppl 2):ii79-ii85, 2005.
17. E. Myers, G. Sutton, A. Delcher, I. Dew, D. Fasulo, M. Flanigan, S. Kravitz, C. Mobarry, K. Reinert, K. Remington, et al. A whole-genome assembly of drosophila. Science, 287(5461):2196-2204, 2000.
18. P. Pevzner, H. Tang, and M. Waterman. An eulerian path approach to DNA fragment assembly. In Proceedings of the National Academy of Sciences, pages 9748-9753, 2001.
19. D. Platt and D. Evers. Forge: A parallel genome assembler combining sanger and next generation sequence data. 2010. http://combiol.org/forge/
20. M. Roberts, W. Hayes, B. Hunt, S. Mount, and J. Yorke. Reducing storage requirements for biological sequence comparison. Bioinformatics, 20(18):3363-3369, 2004.
21. M. Schatz, D. Sommer, D. Kelley, and M. Pop. Contrail: Assembly of large genomes using cloud computing. 2010. http://contrail-bio.sf.net/.
22. J. Simpson and R. Durbin. Efficient construction of an assembly string graph using the fm-index. Bioinformatics, 26(12):i367-i373, 2010.
23. J. Simpson, K. Wong, S. Jackman, J. Schein, S. Jones, and I. Birol. Abyss: a parallel assembler for short read sequence data. Genome research, 19(6):1117-1123, 2009.
24. J. Teuhola. External duplicate deletion with large main memories. 1993.
25. J. Teuhola and L. Wegner. Minimal space, average linear time duplicate deletion. Communications of the ACM, 34(3):62-73, 1991.
26. D. Zerbino and E. Birney. Velvet: algorithms for de novo short read assembly using de bruijn graphs.