A fast algorithm for the partial digest problem

DOI10.1007/S13160-011-0041-1MaRDI QIDQ645279zbMATHOpenAlexFDO

Authors Reza Nadimi, Hassan Salehi Fathabadi, Mohammad Ganjtabesh

Publication date 14 November 2011

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-011-0041-1

zbMATH Keywords

restriction site mapping

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Biophysics (92C05) Theory of computing (68Q99)

Recommendations

• The restriction mapping problem revisited.
• A partial digest approach to restriction site mapping
• scientific article; zbMATH DE number 4147905
• Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
• The simplified partial digest problem: approximation and a graph-theoretic model

Cites work

• scientific article; zbMATH DE number 3017718 (Why is no real title available?)
• scientific article; zbMATH DE number 2209734 (Why is no real title available?)
• A partial digest approach to restriction site mapping
• Partial digest is hard to solve for erroneous input data

Cited in

(7)

• Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
• Partial digest is hard to solve for erroneous input data
• The simplified partial digest problem: approximation and a graph-theoretic model
• An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm
• The restriction mapping problem revisited.
• A lower bound on the number of solutions to the probed partial digest problem
• A new dynamic programming algorithm for the simplified partial digest problem

This page was built for publication: A fast algorithm for the partial digest problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645279)