Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results-Reference-Cited by-同舟云学术

Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results

Published:2009-10 Issue:10 Volume:16 Page:1339-1351
ISSN:1066-5277
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

Swenson Krister M.¹,Lin Yu¹,Rajan Vaibhav¹,Moret Bernard M.E.¹

Affiliation:

1. Laboratory for Computational Biology and Bioinformatics, EPFL (Ecole Polytechnique Fédérale de Lausanne), and Swiss Institute of Bioinformatics, Lausanne, Switzerland.

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

http://www.liebertpub.com/doi/pdf/10.1089/cmb.2009.0156

Reference10 articles.

1. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study

2. A very elementary presentation of the Hannenhalli–Pevzner theory

4. Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals

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

1. Can a breakpoint graph be decomposed into none other than 2-cycles?;Theoretical Computer Science;2018-07

2. Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?;Frontiers in Algorithmics;2016

3. Rearrangements in Phylogenetic Inference: Compare, Model, or Encode?;Models and Algorithms for Genome Evolution;2013