Improved bounds on sorting by length-weighted reversals
From MaRDI portal
Publication:931719
DOI10.1016/j.jcss.2007.08.008zbMath1149.68023MaRDI 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
dynamic programming; potential functions; sorting by reversals; modeling genome rearrangements; sorting 0/1 sequences by reversals
68P10: Searching and sorting
68R05: Combinatorics in computer science
92D10: Genetics and epigenetics
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
Cites Work