An O(n2) algorithm for signed translocation

Journal of Computer and System Sciences

Volumn 70, Issue 3, 2005, Pages 284-299

  Wang, Lusheng ^a   Zhu, Daming ^b   Liu, Xiaowen ^b   Ma, Shaohan ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANDONG UNIVERSITY   (China)

Author keywords

Algorithm; Genome rearrangement; Signed translocation

Indexed keywords

CHROMOSOMES; GENES; GENETIC ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

GENOME REARRANGEMENTS; LINEAR-TIME ALGORITHMS; SIGNED TRANSLOCATION PROBLEMS; SIGNED TRANSLOCATIONS;

GENETIC ENGINEERING;

EID: 15344349832     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.12.005     Document Type: Article

References (21)

1. D.A. Bader, B.M.E. Moret, and M. Yan A linear-time algorithm for computing inversion distance between signed permutation J. Comput. Biol. 8 2001 483 491
2. D.A. Bader, B.M.E. Moret, M. Yan, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study, Proceedings of the Seventh International Workshop on Algorithms and Data Structures, August 2001, pp. 365-376.
3. V. Bafna, and P. Pevzner Sorting by reversals genome rearrangements in plant organelles and evolutionary history of x chromosome Mol. Biol. Evol. 12 1995 239 246
4. A. Bergeron, A very elementary presentation of the Hannenhalli-Pevzner theory, Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, July 2001, pp. 106-117.
5. T. Dobzhansky, and A.H. Sturtevant Inversions in the chromosomes of drosophila pesudoobscura Genetics 23 1938 28 64
6. W.S. Feng, L. Wang, and D. Zhu, CTRD A fast applet for computing signed translocation distance between genomes Bioinformatics 20 2004 3256 3257
7. S. Hannenhalli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 178-189.
8. 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
9. S. Hannenhalli, P. Pevzner, Transforming men into mice: Polynomial algorithm for genomic distance problem, Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, pp. 581-592.
10. S. Hannenhalli, and P. Pevzner Towards a computational theory of genome rearrangement Lecture Notes in Computer Science vol. 1000 1995 Springer Berlin 184 202
11. S. Hannenhalli, Polynomial algorithm for computing translocation distance between genomes, Proceedings of the Sixth Annual Symposium on Combinatorial Pattern Matching, July 1995, pp. 162-176.
12. S. Hannenhalli, P. Pevzner, To cut... or not to cut (applications of comparative physical maps in molecular evolution), Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 1996, pp. 304-313.
13. S. Hannenhalli, and P. Pevzner Transforming cabbage into turnip Polynomial algorithm for sorting signed permutations by reversals J. ACM 46 1 1999 1 27
14. H. Kaplan, R. Shamir, R.E. Tarjan, A faster and simpler algorithm for sorting signed permutations by reversals, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997, pp. 344-351.
15. J. Kececioglu, R. Ravi, Of mice and men: Algorithms for evolutionary distances between genomes with translocation, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, January 1995, pp. 604-613.
16. G. Li, X. Qi, X. Wang, B, Zhu, A linear-time algorithm for computing translocation distance between signed genomes, CPM'2004.
17. D. Sankoff, G. Leduc, N. Antoine, B. Paquin, 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
18. D. Sankoff, and J.H. Nadeau Comparative Genomics Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families Series in Computational Biology vol. 1 2000 Kluwer Academic Press Dordrecht, Netherlands 225 241
19. D. Sankoff, and N. El-Mabrouk Genome rearrangement T. Jiang Y. Xu Q. Zhang Current Topics in Computational Molecular Biology 1992 The MIT Press Cambridge, MA 132 155
20. G. Tesler Efficient algorithms for multichromosomal genome rearrangements J. Comput. System Sci. 65 2002 587 609
21. D.M. Zhu, and S.H. Ma Improved polynomial-time algorithm for computing translocation distance between genomes Chinese J. Comput. (in Chinese) 25 2 2002 189 196