A 1.75-approximation algorithm for unsigned translocation distance

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

Volumn 3827 LNCS, Issue , 2005, Pages 392-401

  Cui, Yun ^a   Wang, Lusheng ^b   Zhu, Darning ^a  

^a SHANDONG UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Approximation algorithm; Unsigned translocation distance

Indexed keywords

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; DATA STRUCTURES; GENE TRANSFER;

APPROXIMATION ALGORITHM; GENOME REARRANGEMENT; UNSIGNED TRANSLOCATION DISTANCE;

GENETIC ALGORITHMS;

EID: 33744952700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_40     Document Type: Conference Paper

References (11)

1. J. Kececioglu and R. Ravi. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In 6th ACM-SIAM Symposium on Discrete Algorithms, 604-613, 1995.
2. Sridhar Hannenhalli. Polynomial-time Algorithm for Computing Translocation Distance between Genomes. CPM'95, 162-176, 1995.
3. 2) algorithm for signed translocation, Journal of Computer and System Sciences, 70, 284-299, 2005.
4. Darning Zhu and Lusheng Wang. On the Complexity of Unsigned Translocation Distance, submited to theoretical computer science.
5. Anne Bergeron, Julia Mixtacki, Jens Stoye, On sorting by translocation, RECOMB'05, 615-629, 2005.
6. S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). STOC'95, 178-189, 1995.
7. H. Kaplan, R. Shamir, and R. E. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing, 29(3), 880-892, 2000.
8. A.Caprara. Sorting by reversals is difficult. Proceedings of the 1st Annual International Conference on Research Computational Molecular Biology, 84-93, 1999.
9. V. Bafna and P. Pevzner. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25(2), 272-289, 1996.
10. D.A. Christie. A 3/2 Approximation Algorithm for Sorting by Reversals. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 244-252, 1998.
11. L. Lovász and M. D. Plummer. Annals of Discrete Mathematics (29): Matching Theory. North-Holland, Amsterdam, 1986