©1996-2009 All Rights Reserved. Online Journal
of Bioinformatics. You may not store these pages in any form except for
your own personal use. All other usage or distribution is illegal under
international copyright treaties. Permission to use any of
these pages in any other way besides the before mentioned must be gained in
writing from the publisher. This article is exclusively copyrighted in
its entirety to OJB publications. This article may be copied once but may not
be reproduced or re-transmitted without the express permission of the editors.
OJB©
Online Journal of Bioinformatics©
Volume 5 : 91-101, 2004
A parallel
DNA fragment assembly algorithm based on eulerian superpath
Zheng W1, Shi W2*, Zhou W2
1
ABSTRACT
Zheng W, Shi W, Zhou W A, Parallel DNA
Fragment Assembly Algorithm Based On Eulerian Superpath, Online J Bioinformatics 5:
91-101, 2004. Assembly tools based on overlap-layout-consensus
paradigm do not resolve the problem of repeats in DNA sequencing. A
parallel DNA fragment assembly algorithm
based on the Eulerian Superpath
which does not require (the memory laden) De-Bruijin
graph, is described. The method proposes to resolve the bottlenecks in current assembly programs. The results demonstrate that
the method has good scalability for
DNA assembly of medium to large eukaryote genomes.
KEY-WORDS: DNA, Fragment Assembly, Algorithm, Eulerian
©1996-2009 All Rights Reserved. Online Journal
of Bioinformatics. You may not store these pages in any form except for
your own personal use. All other usage or distribution is illegal under
international copyright treaties. Permission to use any of
these pages in any other way besides the before mentioned must be gained in
writing from the publisher. This article is exclusively copyrighted in
its entirety to OJB publications. This article may be copied once but may not
be reproduced or re-transmitted without the express permission of the editors.