Sorting by translocations via reversals theory

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

Volumn 4205 LNBI, Issue , 2006, Pages 87-98

  Ozery Flato, Michal ^a   Shamir, Ron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING; THEOREM PROVING;

COMPARATIVE GENOMICS; GENOME REARRANGEMENTS; REVERSALS THEORY; TRANSLOCATIONS;

GENES;

EID: 33750364249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864127_8     Document Type: Conference Paper

References (16)

1. D.A. Bader, B. M.E. Moret, and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology, 8(5):483-491, 2001.
2. A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics, 146(2):134-145, 2005.
3. A. Bergeron, J. Mixtacki, and J. Stoye. On sorting by translocations. Journal of Computational Biology, 13(2):567-578, 2006.
4. P. Berman and S. Hannenhalli. Fast sorting by reversal. In Daniel S. Hirschberg and Eugene W. Myers, editors, Combinatorial Pattern Matching, 7th Annual Symposium, volume 1075 of Lecture Notes in Computer Science, pages 168-185, Laguna Beach, California, 10-12 June 1996. Springer.
5. S. Hannenhalli. Polynomial algorithm for computing translocation distance between genomes. Discrete Applied Mathematics, 71:137-151, 1996.
6. S. Hannenhalli and P. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problems). In 36th Annual Symposium on Foundations of Computer Science (FOCS'95), pages 581-592, Los Alamitos, 1995. IEEE Computer Society Press.
7. S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46:1-27, 1999.
8. (Preliminary version in Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 1995 (STOC 95), pages 178-189).
9. H. Kaplan, R. Shamir, and R. E. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. SI AM Journal of Computing, 29(3):880-892, 2000.
10. (Preliminary version in Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms 1997 (SODA 97), ACM Press, pages 344-351).
11. H. Kaplan and E. Verbin. Sorting signed permutations by reversals, revisited. Journal of Computer and System Sciences, 70(3):321-341, 2005.
12. A preliminary version appeared in Proc. CPM03, Springer, 2003, pages 170-185.
13. J. D. Kececioglu and R. Ravi. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In Proceedings of the 6th Annual Symposium on Discrete Algorithms, pages 604-613, New York, NY, USA, January 1995. ACM Press.
14. J. H. Nadeau and B. A. Taylor. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc Natl Acad Sci USA, 81(3):814-818, 1984.
15. 3/2 √log(n)) algorithm for sorting by reciprocal translocations. Accepted to CPM 2006. Available at http://www.cs.tau.ac.il/~ozery/srt_cpm06.pdf.
16. E. Tannier, A. Bergeron, and M. Sagot. Advances on sorting by reversals, to appear in Discrete Applied Mathematics.