Sorting with fixed-length reversals

DOI10.1016/S0166-218X(96)00069-8MaRDI QIDQ5961630zbMATH OpenFDO

Authors Ting Chen, Steven Skiena

Publication date 7 September 1997

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

interconnection networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Searching and sorting (68P10) Problems related to evolution (92D15)

Recommendations

• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS
• scientific article; zbMATH DE number 1263193
• Genome Rearrangements and Sorting by Reversals

Cites work

• Bounds for sorting by prefix reversal
• Genome Rearrangements and Sorting by Reversals
• scientific article; zbMATH DE number 3732055 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 910920 (Why is no real title available?)
• Polynomial-time algorithm for computing translocation distance between genomes
• Reversing trains: A turn of the century sorting problem
• The complexity of finding minimum-length generator sequences

Cited in

(19)

• Vertex reconstruction in Cayley graphs
• Sorting by bounded block-moves
• Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
• Sorting by reversals and the theory of 4-regular graphs
• A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
• Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
• Sorting parity encodings by reusing variables
• scientific article; zbMATH DE number 5124574 (Why is no real title available?)
• Adjacent Swaps on Strings
• Sorting permutations: games, genomes, and cycles
• Sorting by prefix reversals and prefix transpositions
• Exact upper bound for sorting \(R_n\) with LE
• SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS
• Computing and Combinatorics
• Sorting circular permutations by reversal.
• Inconsistent heuristics in theory and practice
• The `Butterfly effect' in Cayley graphs with applications to genomics.
• Advances on sorting by reversals
• Models of active learning in group-structured state spaces

This page was built for publication: Sorting with fixed-length reversals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961630)