Aligning two fragmented sequences

Vamsi Veeramachaneni, Piotr Berman, Webb Miller

    Research output: Contribution to journalArticle

    3 Scopus citations

    Abstract

    Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to be incompletely sequenced. That is, holes will remain in the known sequence, and the relative order and orientation of the known sequence fragments may not be determined. Sequence comparison between two genomes of this sort may allow some of the fragments to be oriented and ordered relative to each other by computational means. We formalize this as an optimization problem, show that the problem is MAX-SNP hard, and develop a polynomial time algorithm that is guaranteed to produce a solution whose score is within a factor 3 of optimal.

    Original languageEnglish (US)
    Pages (from-to)119-143
    Number of pages25
    JournalDiscrete Applied Mathematics
    Volume127
    Issue number1 SPEC.
    DOIs
    StatePublished - Apr 1 2003

    All Science Journal Classification (ASJC) codes

    • Discrete Mathematics and Combinatorics
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'Aligning two fragmented sequences'. Together they form a unique fingerprint.

  • Cite this

    Veeramachaneni, V., Berman, P., & Miller, W. (2003). Aligning two fragmented sequences. Discrete Applied Mathematics, 127(1 SPEC.), 119-143. https://doi.org/10.1016/S0166-218X(02)00289-5