Tractability and approximability of maximal strip recovery-Reference-Cited by-同舟云学术

Tractability and approximability of maximal strip recovery

Published:2012-07 Issue: Volume:440-441 Page:14-28
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Bulteau Laurent,Fertin Guillaume,Jiang Minghui,Rusu Irena

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference10 articles.

1. Maximal strip recovery problem with gaps: hardness and approximation algorithms;Bulteau,2009

2. On recovering syntenic blocks from comparative maps;Chen;Journal of Combinatorial Optimization,2009

3. M.M. Halldórsson, Approximating discrete collections via local improvements, in: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’95, 1995, pp. 160–169.

4. H. Jiang, Z. Li, G. Lin, L. Wang, B. Zhu, Exact and approximation algorithms for the complementary maximal strip recovery problem. Journal of Combinatorial Optimization, http://dx.doi.org/10.1007/s10878-010-9366-y.

5. On the parameterized complexity of some optimization problems related to multiple-interval graphs;Jiang;Theoretical Computer Science,2010

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics;Algorithms for Molecular Biology;2022-04-02

2. The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes;Comparative Genomics;2022

3. Parameterized Algorithms in Bioinformatics: An Overview;Algorithms;2019-12-01

4. An improved linear kernel for complementary maximal strip recovery: Simpler and smaller;Theoretical Computer Science;2019-09

5. A 42k Kernel for the Complementary Maximal Strip Recovery Problem;Frontiers in Algorithmics;2017