A fast algorithm for the partial digest problem

DOI10.1007/S13160-011-0041-1zbMATH Open1226.92023OpenAlexW2053840591MaRDI QIDQ645279FDOQ645279

Mohammad Ganjtabesh, Hassan Salehi Fathabadi, Reza Nadimi

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)

Cites Work

• Title not available (Why is that?)
• A partial digest approach to restriction site mapping
• Title not available (Why is that?)
• Partial digest is hard to solve for erroneous input data

Cited In (5)

• A lower bound on the number of solutions to the probed partial digest problem
• The restriction mapping problem revisited.
• A new dynamic programming algorithm for the simplified partial digest problem
• An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm
• Partial digest is hard to solve for erroneous input data

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)