Abstract
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to decide whether the exemplar conserved interval distance between any two genomes is zero or not. This result implies that the exemplar conserved interval distance problem does not admit any approximation in polynomial time, unless P=NP. In fact, this result holds, even when every gene appears in each of the given genomes at most three times. Second, we strengthen the first result under a weaker definition of approximation, called weak approximation. We show that the exemplar conserved interval distance problem does not admit any weak approximation within a super-linear factor of \(\frac{2}{7}m^{1.5}\) , where m is the maximal length of the given genomes. We also investigate polynomial time algorithms for solving the exemplar conserved interval distance problem when certain constrains are given. We prove that the zero exemplar conserved interval distance problem of two genomes is decidable in polynomial time when one genome is O(log n)-spanned. We also prove that one can solve the constant-sized exemplar conserved interval distance problem in polynomial time, provided that one genome is trivial.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bafna V, Pevzner P (1995) Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Mol Biol Evol 12:239–246
Bereg S, Zhu B (2005) RNA multiple structural alignment with longest common subsequences. In: Proceedings of the 11th international annual confrerence on computers and combinatorics (COCOON’05). Lecture notes in computer science, vol 3595. Springer, Berlin, pp 32–41
Bergeron A, Stoye J (2003) On the similarity of sets of permutations and its applications to genome comparison. In: Proceedings of the 9th international annual confrerence on computers and combinatorics (COCOON’03). Lecture notes in computer science, vol 2697. Springer, Berlin, pp 68–79
Blin G, Rizzi R (2005) Conserved interval distance computation between non-trivial genomes. In: Proceedings of the 11th international annual confrerence on computers and combinatorics (COCOON’05). Lecture notes in computer science, vol 3595. Springer, Berlin, pp 22–31
Bryant D (2000) The complexity of calculating exemplar distances. In: Sankoff D, Nadeau J (eds) Comparative genomics: empirical and analytical approaches to gene order dynamics, map alignment, and the evolution of gene families. Kluwer Academic, Dordrecht, pp 207–212
Chen Z, Fowler RH, Fu B, Zhu B (2006a) Lowers bounds on the approximation of the conserved interval distance problem of genomes. In: Proceedings of the 12th international annual confrerence on computers and combinatorics (COCOON’06). Lecture notes in computer science, vol 4112. Springer, Berlin, pp 245–254
Chen Z, Fu B, Zhu B (2006b) The approximability of the exemplar breakpoint distance problem. In: Proceedings of the second international conference on algorithmic aspects in information and management (AAIM’06). Lecture notes in computer science, vol. 4041. Springer, Berlin, pp 291–302
Chen Z, Fu B, Xu J, Yang B, Zhao Z, Zhu B (2007) Non-breaking similarity of genomes with gene repetitions, submitted for publication. In: Proceedings of the 18th international symposium on combinatorial pattern matching (CPM’07). Lecture notes in computer science, vol 4580. Springer, Berlin, pp 119–130
Cormen T, Leiserson C, Rivest R, Stein C (2002) Introduction to algorithms, 2nd edn. McGraw–Hill, Cambridge
Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Gascuel O (ed) (2004) Mathematics of evolution and phylogeny. Oxford University Press, Oxford
Hannenhalli S, Pevzner P (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM 46(1):1–27
Li Z, Wang L, Zhang K (2006) Algorithmic approaches for genome rearrangement: a review. IEEE Trans Sys Man Cybern Part C: Appl Rev 36(5):636–648
Makaroff C, Palmer J (1988) Mitochondrial DNA rearrangements and transcriptional alternatives in the male sterile cytoplasm of Ogura radish. Mol Cell Biol 8:1474–1480
Marron M, Swenson K, Moret B (2004) Genomic distances under deletions and insertions. Theor Comput Sci 325(3):347–360
Nguyen CT (2005) Algorithms for calculating exemplar distances. Honors thesis, School of Computing, National University of Singapore
Nguyen CT, Tay YC, Zhang L (2005) Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21(10):2171–2176
Palmer J, Herbon L (1988) Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J Mol Evol 27:87–97
Sankoff D (1999) Genome rearrangement with gene families. Bioinformatics 16(11):909–917
Sturtevant A, Dobzhansky T (1936) Inversions in the third chromosome of wild races of drosophila pseudoobscura and their use in the study of the history of the species. Proc Natl Acad Sci USA 22:448–450
Watterson G, Ewens W, Hall T, Morgan A (1982) The chromosome inversion problem. J Theor Biol 99:1–7
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, Z., Fowler, R.H., Fu, B. et al. On the inapproximability of the exemplar conserved interval distance problem of genomes. J Comb Optim 15, 201–221 (2008). https://doi.org/10.1007/s10878-007-9077-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9077-1