A greedy algorithm for aligning DNA sequences

A greedy algorithm for aligning DNA sequences

For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy alignment algorithm with particularly good performance and show that …

A greedy algorithm for aligning DNA sequences Read More »