Sorting signed permutations by reversals, revisited-Reference-Cited by-同舟云学术

Sorting signed permutations by reversals, revisited

Published:2005-05 Issue:3 Volume:70 Page:321-341
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Kaplan Haim,Verbin Elad

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference31 articles.

1. Cascading divide-and-conquer;Atallah;SIAM J. Comput.,1989

2. A linear-time algorithm for computing inversion distance between two signed permutations with an experimental study;Bader;J. Comput. Biol.,2001

3. Genome rearrangements and sorting by reversals;Bafna;SIAM J. Comput.,1996

4. M.A. Bender, D. Ge, S. He, H. Hu, R.Y. Pinter, S. Skiena, F. Swidan, Improved bounds on sorting with length-weighted reversals, Proceedings of SODA, 2004, pp. 912–921.

5. A. Bergeron, A very elementary presentation of the Hannenhalli–Pevzner theory, Proceedings of CPM, 2001, pp. 106–117.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An O(n3/2log(n)) algorithm for sorting by reciprocal translocations;Journal of Discrete Algorithms;2011-12

2. Constraints on genes shape long-term conservation of macro-synteny in metazoan genomes;BMC Bioinformatics;2011-10-05

3. Restricted DCJ Model: Rearrangement Problems with Chromosome Reincorporation;Journal of Computational Biology;2011-09

4. Advances in Genome Rearrangement Algorithms;Algorithms in Computational Molecular Biology;2010-12-23

5. Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2010-04