A lower bound on the number of solutions to the probed partial digest problem

DOI10.1006/aama.1993.1009zbMath0776.92006OpenAlexW2059727070MaRDI QIDQ1261855

Dalit Naor, Lee Aaron Newberg

Publication date: 5 September 1993

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

Full work available at URL: https://doi.org/10.1006/aama.1993.1009

zbMATH Keywords

Riemann zeta functionhybridizationDNA strandlinear order reconstructionpartially digested DNAprobed partial digestion mapping methodrestriction enzyme cutting sitessizes of fragments

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Miscellaneous applications of number theory (11Z05) Radix representation; digital problems (11A63)

Related Items (6)

The restriction mapping problem revisited. ⋮ DNA physical mapping and alternating Eulerian cycles in colored graphs ⋮ The number of clone orderings ⋮ Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem ⋮ A partial digest approach to restriction site mapping ⋮ Partial digest is hard to solve for erroneous input data

This page was built for publication: A lower bound on the number of solutions to the probed partial digest problem