A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly

Bioinformatics

Volumn 27, Issue 14, 2011, Pages 1901-1907

  Dinh, Hieu ^a   Rajasekaran, Sanguthevar ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; ARTICLE; DATA STORAGE DEVICE; DNA SEQUENCE; INFORMATION SYSTEM; METHODOLOGY;

ALGORITHMS; COMPUTER STORAGE DEVICES; DNA; INFORMATION SYSTEMS; SEQUENCE ANALYSIS, DNA;

EID: 79960120736     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btr321     Document Type: Article

References (9)

1. Abouelhoda,M. et al. (2004) Replace suffix trees with enhanced suffix arrays. J. Dis. Algorithm, 2, 53-86.
2. Gusfield,D. (1997) Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York.
3. Gusfield,D. et al. (1992) An efficient algorithm for the all pairs suffix-prefix problem. Inf. Process. Lett., 41, 181-185.
4. Kurtz,S. (1999) Reducing the space requirement of suffix trees. Softw. Pract. Exp., 29, 1149-1171.
5. Medvedev,P. et al. (2007) Computability of models for sequence assembly. In Proceedings of Workshop on Algorithms for Bioinformatics, pp. 289-301.
6. Myers,E.W. (2005) The fragment assembly string graph. Bioinformatics, 21, 79-85.
7. Ohlebusch,E. and Gog,S. (2010) Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Inf. Process. Lett., 110, 123-128.
8. Pop,M. (2009) Genome assembly reborn: recent computational challenges. Brief. Bioinformatics, 10, 354-366.
9. Simpson,J.T. and Durbin,R. (2010) Efficient construction of an assembly string graph using the fm-index. Bioinformatics, 26, i367-i373.