An exhaustive genome assembly algorithm using k-mers to indirectly perform N-squared comparisons in O(N)

Proceedings - 2004 IEEE Computational Systems Bioinformatics Conference, CSB 2004

Volumn , Issue , 2004, Pages 740-741

  Shah, Maulik K ^a,b   Lee, HoJoon ^a   Rogers, Stephanie A ^a   Touchman, Jeffrey W ^b,c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b TRANSLATIONAL GENOMICS RESEARCH INSTITUTE   (United States)

^c ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL RESEARCH; CONTIGS; DATASET; GENOME ASSEMBLY;

ALGORITHMS; DATA STRUCTURES; DIGITAL LIBRARIES; DNA; GENETIC ENGINEERING; GRAPH THEORY; MICROORGANISMS;

GENES;

EID: 14044268146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Batzoglou, S., Jaffe, D., Stanley, K., Butler, J., Gnerre, S., Mauceli, E., Berger, B., Mesirov, J.P., and Lander, E.S. ARACHNE: A whole-genome shotgun assembler. Genome Res. 2002 Jan 1; 12(1): 177-189.
2. Green P. (1994) Documentation for Phrap (http://www.phrap.org/phrap.docs/ phrap.html)
3. Pevzner PA, Tang H, Waterman MS. An Eulerian path approach to DNA fragment assembly. Proc Natl Acad Sci USA. 2001 Aug 14; 98(17): 9748-9753