Improved bounds on sorting by length-weighted reversals-Reference-Cited by-同舟云学术

Improved bounds on sorting by length-weighted reversals

Author:

Bender Michael A.,Ge Dongdong,He Simai,Hu Haodong,Pinter Ron Y.,Skiena Steven,Swidan Firas

Publisher

Elsevier BV

Subject

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

Reference21 articles.

1. Exploring the set of all minimal sequences of reversals—An application to test the replication-directed reversal hypothesis;Ajana,2002

2. Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome;Bafna;Mol. Biol. Evol.,1994

4. A very elementary presentation of the Hannenhalli–Pevzner theory;Bergeron,2001

5. 1.375-Approximation algorithm for sorting by reversals;Berman,2002

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

3. Length-weighted $$\lambda $$-rearrangement distance;Journal of Combinatorial Optimization;2020-11-18

5. An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2019-01-01