On the complexity of unsigned translocation distance

Theoretical Computer Science

Volumn 352, Issue 1-3, 2006, Pages 322-328

  Zhu, Daming ^a   Wang, Lusheng ^b  

^a SHANDONG UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Inapproximability; NP hardness; Unsigned translocation

Indexed keywords

APPROXIMATION THEORY;

INAPPROXIMABILITY; NP-HARDNESS; UNSIGNED TRANSLOCATION;

COMPUTER SCIENCE;

EID: 32644431651     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.078     Document Type: Article

References (16)

1. V. Bafna, and P. Pevzner Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of x chromosome Mole. Biol. Evol. 12 1995 239 246
2. V. Bafna, and P. Pevzner Genome rearrangement and sorting by reversals SIAM J. Comput. 25 2 1996 272 289
3. P. Berman, M. Karpinski, On some tighter inapproximability results, ECCC Report No. 65, University of Trier, 1998.
4. A. Caprara, Sorting by reversal is difficult, Proc. First Annu. Internat. Conf. on Computational Molecular Biology 1997, pp. 75-83.
5. S. Hannenhalli Polynomial time algorithm for computing translocation distance between genomes Discrete Appl. Math. 71 1996 137 151
6. S. Hannenhalli, C. Chappey, E.V. Koonin, and P. Pevzner Genome sequence comparison and scenarios for gene rearrangements: a test case Genomics 30 1995 299 311
7. S. Hannenhalli, and P. Pevzner Towards a computational theory of genome rearrangement Lecture Notes in Comput. Sci. 1000 1995 184 202
8. S. Hannenhalli, P. Pevzner, To cut or not to cut (applications of comparative physical maps in molecular evolution), Proc. Seventh Annu. ACM-SIAM Symp. on Discrete Algorithms, January 1996, pp. 304-313.
9. S. Hannenhalli, and P. Pevzner Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals J. ACM 46 1 1999 1 27
10. H. Kaplan, R. Shamir, R.E. Tarjan, Faster and simpler algorithm for sorting signed permutations by reversals, Proc. Eighth ACM-SIAM Symp. on Discrete Algorithms, ACM Press, New York, 1997.
11. J. Kececioglu, R. Ravi, Of mice and men: algorithms for evolutionary distances between genomes with translocation, Proc. Eighth Annu. ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 604-613.
12. J. Kececioglu, D. Sankoff, Exact and approximation algorithms for the inversion distance between two permutations, Proc. Fourth Annu. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 684, Springer, Berlin, 1993, pp. 87-105.
13. G. Li, X. Qi, X. Wang, B. Zhu, A linear time algorithm for computing translocation distance between signed genomes, Proc. CPM'2004, Lecture Notes in Computer Science, Vol. 3109, Springer, Berlin, 2004.
14. D. Sankoff, G. Leduc, N. Antoine, B. Paquine, B.F. Lang, and R. Cedergen Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome Proc. Natl. Acad. Sci. USA 89 1992 6575 6579
15. 2) algorithm for signed translocation J. Comput. Syst. Sci. 70 2005 284 299
16. D.M. Zhu, and S.H. Ma An improved polynomial time algorithm for translocation sorting problems J. Comput. 25 2 2002 189 196 (in Chinese)