Tractability and Approximability of Maximal Strip Recovery
An essential task in comparative genomics is usually to decompose two or more genomes into synteny blocks, that is, segments of chromosomes with similar contents. In this paper, we study the Maximal Strip Recovery problem (MSR) [Zheng et al. 07], which aims at finding an optimal decomposition of a set of genomes into synteny blocks, amidst possible noise and ambiguities. We present a panel of new or improved FPT and approximation algorithms for the MSR problem and its variants. Our main results include the first FPT algorithm for the variant δ-gap-MSR-d, an FPT algorithm for CMSR-d and δ-gap-CMSR-d running in time O(2.360kpoly(nd)), where k is the number of markers or genes considered as erroneous, and a (d + 1.5)-approximation algorithm for CMSR-d and δ-gap-CMSR-d.
Unable to display preview. Download preview PDF.
- 4.Halldórsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 160–169 (1995)Google Scholar
- 5.Jiang, H., Li, Z., Lin, G., Wang, L., Zhu, B.: Exact and approximation algorithms for the complementary maximal strip recovery problem. In: Journal of Combinatorial Optimization (to appear), doi:10.1007/s10878-010-9366-yGoogle Scholar