DNA physical mapping and alternating Eulerian cycles in colored graphs
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 wordsGraph theory DNA mapping DNA sequencing
Unable to display preview. Download preview PDF.
- [AY]Allison, L., and Yee, C. N. Restriction site mapping is in separation theory.CABIOS,4 (1988), 97–101.Google Scholar
- [B]Bellon, B. Construction of restriction maps.CABIOS,4 (1988), 111–115.Google Scholar
- [BMPS]Benkouar, A., Manoussakis, Y. G., Paschos, V. T., and Saad R. On the complexity of some Hamiltonian and Eulerian problems in edge-coloured complete graphs. In W. L. Hsu and R. C. T. Lee (eds.),ISA '91 Algorithms. Proceedings of the 2nd International Symposium on Algorithms, Taipei, December 1991. Lecture Notes in Computer Science, Vol. 557. Springer-Verlag, Berlin, 1991, pp. 190–198.Google Scholar
- [DK]Dix, T. I., and Kieronska, D. H. Errors between sites in restriction site mapping.CABIOS,4 (1988), 117–123.Google Scholar
- [GM1]Grigorjev, A. V., and Mironov, A. A. Mapping DNA by stochastic relaxation: a new approach to fragment sizes.CABIOS,6 (1990), 107–111.Google Scholar
- [GM2]Grigorjev, A. V., and Mironov, A. A. Mapping DNA by stochastic relaxation: a schedule for optimal annealing.J. DNA Mapping and Sequencing,1 (1991), 221–226.Google Scholar
- [Ha]Hall, M., Jr.,Combinatorial Theory. Toronto, 1967.Google Scholar
- [HAY]Ho, S. T. S., Allison, L., and Yee, C. N. Restriction site mapping for three or more enzymes.CABIOS,6 (1990), 195–204.Google Scholar
- [Hoy]Hoyle, P. Use of commercial software on IBM personal computers. In M. J. Bishop and C. J. Rawlings (eds),Nucleic Acids and Protein Sequence Analysis: Practical Approaches. IRL Press, Oxford, 1987, pp. 47–82.Google Scholar
- [MAB+]Mironov, A. A., Alexandrov, N. N., Bogodarova, N. Yu., Grigorjev, A., Lebedev, V. F., Lunovskaya, L. V., Pevzner, P. A., and Truchan M. E. DNASUN: A Package of Computer Programs for Biotechnology Laboratory (submitted).Google Scholar
- [Pev1]Pevzner, P. A. Graphs of restrictions and DNA physical mapping.Biopolymers and Cell,5 (1988), 233–237 (in Russian).Google Scholar
- [Pev2]Pevzner, P. A. ι-tuple DNA sequencing: a computer analysis.J. Biom. Struct. Dyn.,7 (1989), 63–73.Google Scholar
- [Pev3]Pevzner, P. A. DNA physical mapping. In M. D. Frank-Kamenetzky (ed.),Computer Analysis of Genetic Texts. Nauka, Moscow, 1990, pp. 154–188 (in Russian).Google Scholar
- [Pev4]Pevzner, P. A.DNA Physical Mapping, Flows in Networks and Minimum Cycles Mean in Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 8, 1992, pp. 99–112.Google Scholar
- [Pev5]Pevzner, P. A. (1994) MAPSUN: a DNA physical mapping computer algorithm (in preparation).Google Scholar
- [PM]Pevzner, P. A., and Mironov, A. A. An efficient method for physical mapping of DNA molecules.Molek. Biol,21 (1987), 788–796.Google Scholar
- [TDMH]Tuffery, P., Dessen, P., Mugnier, C., and Hazout, S. Restriction map construction using a “complete sentences compatibility” algorithm.CABIOS,4 (1988), 103–110.Google Scholar
- [Y]Yap, R. H. C. Restriction site mapping in CLP(ℛ).Proceedings of the 8th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 521–534.Google Scholar
- [ZFL]Zehetner, G., Frischauf, A., and Lehrach, H. Approaches to restriction map determination. In M. J. Bishop and C. J. Rawlings (eds.),Nucleic Acids and Protein Sequences Analysis, Practical Approaches. IRL Press, Oxford, 1987, pp. 147–164.Google Scholar