Multiple solutions of DNA restriction mapping problems

Authors:
William Schmitt;Michael S Waterman
Affiliations:
Department of Mathematics, Memphis State University, Memphis, Tennessee 38152 U.S.A.;Department of Mathematics, University of Southern California, Los Angeles, California 90089-1113 U.S.A.
Venue:
Advances in Applied Mathematics
Year:
1991

Citing 0
Cited 9

Mapping the genome: some combinatorial problems arising in molecular biology

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
The Enhanced Double Digest Problem for DNA Physical Mapping

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On the complexity of the DNA simplified partial digest problem

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming

International Journal of Bioinformatics Research and Applications
The Double Digest Problem: finding all solutions

International Journal of Bioinformatics Research and Applications
Double digest revisited: complexity and approximability in the presence of noisy data

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Genetic algorithm for double digest problem

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
On the complexity of the DNA simplified partial digest problem

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51

Quantified Score

Hi-index	0.00

Visualization

Abstract

The construction of a restriction map of a DNA molecule from fragment length data is known to be NP hard. However, it is also known that under a simple model of randomness the number of solutions to the mapping problem increases exponentially with the length of the DNA molecule. In this paper we define a hierarchy of equivalence relations on the set of all solutions to the mapping problem and study the combinatorics and characterization of the equivalence classes.