Multiple solutions of DNA restriction mapping problems

DOI10.1016/0196-8858(91)90028-HzbMath0760.92007OpenAlexW2007888399MaRDI QIDQ1190148

Michael S. Waterman, William R. Schmitt

Publication date: 27 September 1992

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(91)90028-h

zbMATH Keywords

NP-hardDNA sequencesenzymesDDPDNA restriction mappingdouble digest-problemequivalence of solutionsfragment lengthhierarchy of equivalence relations

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Related Items (5)

DNA physical mapping and alternating Eulerian cycles in colored graphs ⋮ The number of clone orderings ⋮ A new dynamic programming algorithm for the simplified partial digest problem ⋮ Selected combinatorial problems of computational biology ⋮ Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem

Cites Work

• Interval graphs and maps of DNA
• Mapping DNA by stochastic relaxation
• Unnamed Item

This page was built for publication: Multiple solutions of DNA restriction mapping problems