Display Settings:

Format

Send to:

Choose Destination
    Proc Natl Acad Sci U S A. 2001 Aug 14;98(17):9748-53.

    An Eulerian path approach to DNA fragment assembly.

    Source

    Department of Computer Science and Engineering, University of California, San Diego, La Jolla, USA.

    Abstract

    For the last 20 years, fragment assembly in DNA sequencing followed the "overlap-layout-consensus" paradigm that is used in all currently available assembly tools. Although this approach proved useful in assembling clones, it faces difficulties in genomic shotgun assembly. We abandon the classical "overlap-layout-consensus" approach in favor of a new euler algorithm that, for the first time, resolves the 20-year-old "repeat problem" in fragment assembly. Our main result is the reduction of the fragment assembly to a variation of the classical Eulerian path problem that allows one to generate accurate solutions of large-scale sequencing problems. euler, in contrast to the celera assembler, does not mask such repeats but uses them instead as a powerful fragment assembly tool.

    PMID:
    11504945
    [PubMed - indexed for MEDLINE]
    PMCID:
    PMC55524
    Free PMC Article

    Images from this publication.See all images (5) Free text

    Figure 2
    Figure 4
    Figure 1
    Figure 3
    Figure 5

      Supplemental Content

      Icon for HighWire Press Icon for PubMed Central

      Save items

      loading

      Recent activity

      Your browsing activity is empty.

      Activity recording is turned off.

      Turn recording back on

      See more...
      Write to the Help Desk