| 摘要 |
<p>A new Eulerian Superpath approach to fragment assembly in DNA sequencing that resolves the problem of repeats in fragment assembly is disclosed. The invention provides for the reduction of the fragment assembly to a variation of the classical Eulerian path problem. This reduction opens new possibilities for repeat resolution and allows one to generate provably optimal error-free solutions of the large-scale fragment assembly problems.</p> |
