Improved bounds on sorting by length-weighted reversals

DOI10.1016/j.jcss.2007.08.008zbMath1149.68023OpenAlexW2037187792MaRDI QIDQ931719

Michael A. Bender, Firas Swidan, Haodong Hu, Simai He, Ron Yair Pinter, Steven S. Skiena, Dong-Dong Ge

Publication date: 26 June 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.08.008

zbMATH Keywords

dynamic programmingpotential functionssorting by reversalsmodeling genome rearrangementssorting 0/1 sequences by reversals

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Genetics and epigenetics (92D10)

Related Items

Models and Algorithms for Genome Rearrangement with Positional Constraints ⋮ Approximation algorithms for sorting by length-weighted prefix and suffix operations ⋮ Sorting permutations and binary strings by length-weighted rearrangements ⋮ Length-weighted \(\lambda\)-rearrangement distance ⋮ Finding Local Genome Rearrangements

Cites Work

• Transforming cabbage into turnip
• Genome Rearrangements and Sorting by Reversals
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item