The simplified partial digest problem: approximation and a graph-theoretic model
DOI10.1016/j.ejor.2010.07.027zbMath1206.90238OpenAlexW2075410301WikidataQ57387736 ScholiaQ57387736MaRDI QIDQ621677
Jacek Błażewicz, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov, Edmund Kieran Burke
Publication date: 28 January 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.027
Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20)
Related Items (2)
Uses Software
Cites Work
- Selected combinatorial problems of computational biology
- An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors
- A partial digest approach to restriction site mapping
- An ant colony optimization algorithm for DNA sequencing by hybridization
- Some necessary clarifications about the chords' problem and the partial digest problem
- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data
- DNA Sequencing by Hybridization via Genetic Search
- Genetic and Tabu search algorithms for peptide assembly problem
- An Eulerian path approach to DNA fragment assembly
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
- Some operations research methods for analyzing protein sequences and structures
- LATIN 2004: Theoretical Informatics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The simplified partial digest problem: approximation and a graph-theoretic model
