Z Zhang1, S Schwartz, L Wagner
1Department of Computer Science and Engineering, The Pennsylvania State University, University Park 16802, USA.
A new greedy algorithm offers a faster method for aligning DNA sequences with errors, achieving optimal results comparable to dynamic programming but over 10 times quicker. This breakthrough accelerates DNA sequence alignment for databases like UniGene.
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: