On the approximability of comparing genomes with duplicates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4921 LNCS, Issue , 2008, Pages 34-45

  Angibaud, Sébastien ^a   Fertin, Guillaume ^a   Rusu, Irena ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

Adjacencies; APX Hardness; Breakpoints; Common intervals; Conserved intervals; Duplicates; Genome rearrangement

Indexed keywords

IMAGE RETRIEVAL; IMAGE SEGMENTATION; KETONES;

ADJACENCIES; APPROXIMABILITY; APX-HARDNESS; BREAKPOINTS; COMMON INTERVALS; COMPARATIVE GENOMICS; CONSERVED INTERVALS; DUPLICATES; GENOME REARRANGEMENT; MAXIMUM MATCHING; PHYLOGENETIC TREES; RELABELING; SIMILARITY MEASURING;

GENES;

EID: 50049128860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77891-2_4     Document Type: Conference Paper

References (17)

1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science 237(1-2), 123-134 (2000)
2. Angibaud, S., Fertin, G., Rusu, I., Vialette, S.: A general framework for computing rearrangement distances between genomes with duplicates. Journal of Computational Biology 14(4), 379-393 (2007)
3. Bafna, V., Pevzner, P.: Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, 239-246 (1995)
4. Blin, G., Rizzi, R.: Conserved interval distance computation between non-trivial genomes. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 22-31. Springer, Heidelberg (2005)
5. Bryant, D.: 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, pp. 207-212. Kluwer Academic Publishers, Dordrecht (2000)
6. Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Genomes containing duplicates are hard to compare. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3992, pp. 783-790. Springer, Heidelberg (2006)
7. Chen, Z., Fu, B., Xu, J., Yang, B., Zhao, Z., Zhu, B.: Non-breaking similarity of genomes with gene repetitions. In: CPM 2007. LNCS, vol. 4580, pp. 119-130. Springer, Heidelberg (2007)
8. Chen, Z., Fu, B., Zhu, B.: The approximability of the exemplar breakpoint distance problem. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 291-302. Springer, Heidelberg (2006)
9. Crochemore, M., Hermelin, D., Landau, G.M., Vialette, S.: Approximating the 2interval pattern problem. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 426-437. Springer, Heidelberg (2005)
10. Goldstein, A., Kolman, P., Zheng, Z.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 473-484. Springer, Heidelberg (2004)
11. Kolman, P., Waleń, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. In: Erlebach, T., Kaklamanis, C (eds.) WAOA 2006. LNCS, vol. 4368, pp. 279-289. Springer, Heidelberg (2007)
12. Li, W., Gu, Z., Wang, H., Nekrutenko, A.: Evolutionary analysis of the human genome. Nature (409), 847-849 (2001)
13. Marron, M., Swenson, K.M., Moret, B.M.E.: Genomic distances under deletions and insertions. Theoretical Computer Science 325(3), 347-360 (2004)
14. Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425-440 (1991)
15. Sankoff, D.: Genome rearrangement with gene families. Bioinformatics 15(11), 909-917 (1999)
16. Sankoff, D., Haque, L.: Power boosts for cluster tests. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3678, pp. 121-130. Springer, Heidelberg (2005)
17. Tang, J., Moret, B.M.E.: Phylogenetic reconstruction from gene-rearrangement data with unequal gene content. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 37-46. Springer, Heidelberg (2003)