On the approximability of comparing genomes with duplicates

Journal of Graph Algorithms and Applications

Volumn 13, Issue 1, 2009, Pages 19-53

  Angibaud, Sébastien ^a   Fertin, Guillaume ^a   Rusu, Irena ^a   Thévenin, Annelyse ^b   Vialette, Stéphane ^c  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITÉ PARIS EST   (France)

Author keywords

Adjacencies; Approximation algorithms; APX hardness; Breakpoints; Common intervals; Conserved intervals; Duplicate genes; Genome rearrangements

Indexed keywords

EID: 70349742235     PISSN: None     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00175     Document Type: Article

References (25)

1. P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237(1-2):123-134, 2000.
2. S. Angibaud, G. Fertin, I. Rusu, A. Thévenin, and S. Vialette. Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. Journal of Computational Biology, 2008. Submitted.
3. S. Angibaud, G. Fertin, I. Rusu, and S. Vialette. A general framework for computing rearrangement distances between genomes with duplicates. Journal of Computational Biology, 14(4):379-393, 2007.
4. V. Bafna and P. Pevzner. Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, pages 239-246, 1995.
5. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. SODA'94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pages 365-371, Philadelphia, PA, USA, 1994. Society for Industrial and Applied Mathematics.
6. G. Blin and R. Rizzi. Conserved interval distance computation between non-trivial genomes. In Proc. COCOON 2005, volume 3595 of LNCS, pages 22-31. Springer, 2005.
7. D. Bryant. The complexity of calculating exemplar distances. In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignement, and the Evolution of Gene Families, pages 207-212. Kluwer Academic Publisher, 2000.
8. M.-S. Chang and F.-H. Wang. Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Information Processing Letters, 43(6):293-295, 1992.
9. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for maximum constraint satisfaction problems. In SODA'07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pages 62-68, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
10. C. Chauve, G. Fertin, R. Rizzi, and S. Vialette. Genomes containing duplicates are hard to compare. In Proc. IWBRA 2006, volume 3992 of LNCS, pages 783-790. Springer, 2006.
11. Z. Chen, R. Fowler, B. Fu, and B. Zhu. Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes. In Proc COCOON 2006, volume 4112 of LNCS, pages 245-254. Springer, 2006.
12. Z. Chen, B. Fu, J. Xu, B. Yang, Z. Zhao, and B. Zhu. Non-breaking similarity of genomes with gene repetitions. In Proc. CPM 2007, volume 4580 of LNCS, pages 119-130, 2007.
13. Z. Chen, B. Fu, and B. Zhu. The approximability of the exemplar breakpoint distance problem. In Proc. AAIM 2006, volume 4041 of LNCS, pages 291-302. Springer, 2006.
14. M. Crochemore, D. Hermelin, G. M. Landau, and S. Vialette. Approximating the 2-interval pattern problem. In Proc. ESA 2005, volume 3669 of LNCS, pages 426-437. Springer, 2005.
15. H. Fernau. Parameterized algorithms: A graph-theoretic approach. Habilitationsschrift, 2005.
16. M. Garey and D. Johnson. Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Franciso, 1979.
17. A. Goldstein, P. Kolman, and Z. Zheng. Minimum common string partition problem: Hardness and approximations. In Proc. ISAAC 2004, volume 3341 of LNCS, pages 473-484. Springer, 2004.
18. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
19. P. Kolman and T. Walen. Reversal distance for strings with duplicates: Linear time approximation using hitting set. In Proc. WAOA 2006, volume 4368 of LNCS, pages 279-289. Springer, 2006.
20. W. Li, Z. Gu, H. Wang, and A. Nekrutenko. Evolutionary analysis of the human genome. Nature, 409:847-849, 2001.
21. M. Marron, K. M. Swenson, and B. M. E. Moret. Genomic distances under deletions and insertions. Theoretical Computer Science, 325(3):347-360, 2004.
22. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440,1991.
23. D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):909-917, 1999.
24. D. Sankoff and L. Haque. Power boosts for cluster tests. In Proc. RECOMB-CG 2005, volume 3678 of LNCS, pages 121-130. Springer, 2005.
25. J. Tang and B. M. E. Moret. Phylogenetic reconstruction from generearrangement data with unequal gene content. In Proc. WADS 2003, volume 2748 of LNCS, pages 37-46. Springer, 2003.