A new dynamic programming algorithm for the simplified partial digest problem

DOI10.1016/j.tcs.2023.113801OpenAlexW4323349686MaRDI QIDQ2697542

Biing-Feng Wang

Publication date: 12 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113801

zbMATH Keywords

algorithmsdynamic programmingbacktrackinggenome mappingrestriction sites analysis

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The simplified partial digest problem: approximation and a graph-theoretic model
• A fast algorithm for the partial digest problem
• On the approximability of the simplified partial digest problem
• Multiple solutions of DNA restriction mapping problems
• A partial digest approach to restriction site mapping
• Some necessary clarifications about the chords' problem and the partial digest problem
• Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
• LATIN 2004: Theoretical Informatics

This page was built for publication: A new dynamic programming algorithm for the simplified partial digest problem