Reversals and transpositions over finite alphabets (original) (raw)
Related papers
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics, 2007
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences, 2008
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
Lecture Notes in Computer Science, 2007
Prefix and Suffix Reversals on Strings
String Processing and Information Retrieval, 2015
On the Cost of Interchange Rearrangement in Strings
Springer eBooks, 2007
An algorithm to enumerate sorting reversals for signed permutations
2003
An (18/11)n upper bound for sorting by prefix reversals
Theoretical Computer Science, 2009
Sorting by Restricted-Length-Weighted Reversals
Genomics, Proteomics & Bioinformatics, 2005
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms, 2008
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics, 2007
Sorting by Reciprocal Translocations via Reversals Theory
Journal of Computational Biology, 2007
Sorting by Translocations Via Reversals Theory
Lecture Notes in Computer Science, 2006
New bounds and tractable instances for the transposition distance
2006
Approximation Algorithm for Sorting by Reversals and Transpositions
2007
An algorithm to enumerate all sorting reversals
2002
An algorithm for string edit distance allowing substring reversals
Sixth IEEE Symposium on BioInformatics and BioEngineering (BIBE'06), 2006
Efficient computations ofℓ1 andℓ∞ rearrangement distances
Theoretical Computer Science, 2009
On Reverse-Free Codes and Permutations
Siam Journal on Discrete Mathematics, 2010
Flipping Letters to minimize the Support of a String
International Journal of Foundations of Computer Science, 2008
The solution space of sorting by reversals
2007
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing, 2000
Journal of Computational Biology, 2001
Sorting by Prefix Reversals and Prefix Transpositions with Forward March
Arxiv preprint arXiv:0812.3933, 2008
Improved Time and Space Complexities for Transposition Invariant String Matching
2004
2008
A barrier for further approximating Sorting By Transpositions
arXiv (Cornell University), 2023
A Lower Bound on the Reversal and Transposition Diameter
Journal of Computational Biology, 2002