Results 101 to 110 of about 1,350 (116)

(1+ε)-Approximation of sorting by reversals and transpositions

Theoretical Computer Science, 2002
Niklas Eriksen
exaly  

Improved bounds on sorting by length-weighted reversals

Journal of Computer and System Sciences, 2008
Steven Skiena, Simai He, Michael A Bender   +2 more
exaly  

On Sorting by Unsigned Symmetric Reversals

Wenfeng Lai, Haitao Jiang, Daming Zhu, Binhai Zhu   +3 more
openaire   +1 more source

Formulations and hardness of multiple sorting by reversals

Proceedings of the third annual international conference on Computational molecular biology, 1999
openaire   +1 more source

Sorting by Reciprocal Translocations via Reversals Theory

Journal of Computational Biology, 2007
Michal Ozery-Flato, Ron Shamir
exaly  

Sorting Permutations by Reversals through a Hybrid Genetic Algorithm based on Breakpoint Elimination and Exact Solutions for Signed Permutations

Electronic Notes in Theoretical Computer Science, 2013
Mauricio Ayala-Rincón, JOSÉ Luis Soncco-Álvarez   +1 more
exaly  

Sorting Permutations by Reversals and Eulerian Cycle Decompositions

SIAM Journal on Discrete Mathematics, 1999
Alberto Caprara
exaly  

Sorting Circular Permutations by Super Short Reversals

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017
Gustavo Rodrigues Galvao, Zanoni Dias
exaly  

Perfect Sorting by Reversals Is Not Always Difficult

IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2007
Christophe Paul, Cedric Chauve, Anne Bergeron   +2 more
exaly  

Sorting signed permutations by reversals using link-cut trees

Information Processing Letters, 2018
Irena Rusu
exaly