P A Pevzner1, H Tang, M S Waterman
1Department of Computer Science and Engineering, University of California, San Diego, La Jolla, USA.
A new euler algorithm resolves the 20-year-old "repeat problem" in DNA sequencing fragment assembly. This approach uses repeats as a tool, unlike older methods, for accurate large-scale sequencing solutions.
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: