Algorithmica

, Volume 13, Issue 1–2, pp 77–105

DNA physical mapping and alternating Eulerian cycles in colored graphs

  • P. A. Pevzner
Article

DOI: 10.1007/BF01188582

Cite this article as:
Pevzner, P.A. Algorithmica (1995) 13: 77. doi:10.1007/BF01188582

Abstract

Small-scale DNA physical mapping (such as the Double Digest Problem or DDP) is an important and difficult problem in computational molecular biology. When enzyme sites are modeled by a random process, the number of solutions to DDP is known to increase exponentially as the length of DNA increases. However, the overwhelming majority of solutions are very similar and can be transformed into each other by simple transformations. Recently, Schmitt and Waterman [SW] introduced equivalence classes on the set of DDP solutions and raised an open problem to completely characterize equivalent physical maps.

We study the combinatorics of multiple solutions and the cassette transformations of Schmitt and Waterman. We demonstrate that the solutions to DDP are closely associated with alternating Eulerian cycles in colored graphs and study order transformations of alternating cycles. We prove that every two alternating Eulerian cycles in a bicolored graph can be transformed into each other by means of order transformations. Using this result we obtain a complete characterization of equivalent physical maps in the Schmitt-Waterman problem. It also allows us to prove Ukkonen's conjecture on word transformations preservingq-gram composition.

Key words

Graph theory DNA mapping DNA sequencing 

Copyright information

© Springer-Verlag New York Inc. 1995

Authors and Affiliations

  • P. A. Pevzner
    • 1
  1. 1.Computer Science DepartmentThe Pennsylvania State UniversityUniversity ParkUSA

Personalised recommendations