A linear-time algorithm for computing inversion distance between signed permutations with an experimental study

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

Volumn 2125, Issue , 2001, Pages 365-376

  Bader, David A ^a   Moret, Bernard M E ^a   Yan, Mi ^a  

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; DATA STRUCTURES; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL EXPERIMENT; CONNECTED COMPONENT; DISTANCE CALCULATION; DISTANCE COMPUTATION; LINEAR-TIME ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; SIGNED PERMUTATIONS; SIMULATED EVOLUTIONS;

ALGORITHMS;

EID: 84958047970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_34     Document Type: Conference Paper

References (22)

1. [1] V. Bafna and P. Pevzner. Sorting permutations by transpositions. In Proceedings of the 6th Annual Symposium on Discrete Algorithms, pages 614-623, New York, January 1995. ACM Press.
2. [2] V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS93), pages 148- 157. IEEE Press, 1993.
3. [3] V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25:272-289, 1996.
4. [4] V. Bafna and P. A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11:224-240, 1998.
5. [5] P. Berman and S. Hannenhalli. Fast Sorting by Reversal. In D.S. Hirschberg and E.W. Myers, editors, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, pages 168-185, Laguna Beach, CA, June 1996. Lecture Notes in Computer Science, 1075, Springer-Verlag.
6. [6] M. Blanchette, G. Bourque, and D. Sankoff. Breakpoint phylogenies. In S. Miyano and T. Takagi, editors, Genome Informatics, pages 25-34. University Academy Press, Tokyo, Japan, 1997.
7. [7] A. Caprara. Sorting by reversals is difficult. In Proceedings of the 1st Conference on Computational Molecular Biology (RECOMB97), pages 75-83, Santa Fe, NM, 1997. ACM Press.
8. [8] A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math., 12(1):91-110, 1999.
9. [9] M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman. A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB00), pages 104-115, San Diego, CA, 2000.
10. [10] S. Hannenhalli. Software for computing inversion distances between signed gene orders. Department of Mathematics, University of Southern California, URL. www-hto.usc.edu/plain/people/Hannenhalli.html.
11. [11] S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual Symposium on Theory of Computing (STOC95), pages 178-189, Las Vegas, NV, 1995. ACM Press.
12. [12] H. Kaplan, R. Shamir, and R.E. Tarjan. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal of Computing, 29(3):880-892, 1999. First appeared in Proceedings of the 8th Annual Symposium on Discrete Algorithms (SODA97), 344-351, New Orleans, LA. ACM Press.
13. [13] I. Mantin and R. Shamir. Genome Rearrangement Algorithm Applet: An algorithm for sorting signed permutations by reversals. www.math.tau.ac.il/∼rshamir/GR/, 1999.
14. [14] C.C. McGeoch. Toward an experimental method for algorithm simulation. INFORMS Journal of Computing, 8:1-15, 1996.
15. [15] B. M.E. Moret, S. Wyman, D.A. Bader, T. Warnow, and M. Yan. A new implementation and detailed study of breakpoint analysis. In Proceedings of the 6th Pacific Symposium on Biocomputing (PSB2001), pages 583-594, Big Island, HI, January 2001.
16. B.M.E. Moret. Towards a discipline of experimental algorithmics. In DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 2001. To appear. Available at www.cs.unm.edu/∼moret/dimacs.ps.
17. [17] J.H. Nadeau and B.A. Taylor. Lengths of chromosome segments conserved since divergence of man and mouse. In Proceedings of the National Academy of Sciences, volume 81, pages 814-818, 1984.
18. [18] R.G. Olmstead and J.D. Palmer. Chloroplast DNA systematics: a review of methods and data analysis. American Journal of Botany, 81:1205-1224, 1994.
19. [19] J.D. Palmer. Chloroplast and mitochondrial genome evolution in land plants. In R. Herrmann, editor, Cell Organelles, pages 99-133. Springer Verlag, 1992.
20. [20] L.A. Raubeson and R.K. Jansen. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science, 255:1697-1699, 1992.
21. [21] D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology, 5:555-570, 1998.
22. [22] J.C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS, Boston, MA, 1997