On the Tractability of Maximal Strip Recovery

DOI10.1007/978-3-642-02017-9_42MaRDI QIDQ3630225zbMATH OpenOpenAlexFDO

Authors Lusheng Wang, Binhai Zhu

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_42

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32) Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Recommendations

• Efficient exact and approximate algorithms for the complement of Maximal Strip Recovery
• Tractability and approximability of maximal strip recovery
• On recovering syntenic blocks from comparative maps
• On Recovering Syntenic Blocks from Comparative Maps

Cited in

(10)

• On recovering syntenic blocks from comparative maps
• Maximal strip recovery problem with gaps: hardness and approximation algorithms
• Tractability and approximability of maximal strip recovery
• Efficient exact and approximate algorithms for the complement of Maximal Strip Recovery
• Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
• Exact and approximation algorithms for the complementary maximal strip recovery problem
• Tractability and approximability of maximal strip recovery
• On Recovering Syntenic Blocks from Comparative Maps
• Inapproximability of maximal strip recovery
• On the parameterized complexity of some optimization problems related to multiple-interval graphs

This page was built for publication: On the Tractability of Maximal Strip Recovery

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