Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery

DOI10.1007/978-3-642-14355-7_33zbMath1286.68538OpenAlexW1523150436MaRDI QIDQ3578387

Binhai Zhu

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14355-7_33

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (3)

Maximal strip recovery problem with gaps: hardness and approximation algorithms ⋮ Tractability and approximability of maximal strip recovery ⋮ Tractability and Approximability of Maximal Strip Recovery

This page was built for publication: Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery