A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study (original) (raw)
Related papers
A fast linear-time algorithm for inversion distance with an experimental comparison
J. Comput. Biol, 2001
An algorithm to enumerate sorting reversals for signed permutations
2003
Lower bounding exit distances between permutations
2013
Sorting Signed Permutations by Inversions in O ( n log n ) Time
Journal of Computational Biology, 2010
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing, 2000
Edit Distances and Factorisations of Even Permutations
Algorithms-ESA 2008, 2008
Lower bounding edit distances between permutations
SIAM Journal on Discrete Mathematics 27 (3), 1410-1028, 2013
A graphical model for computing the minimum cost transposition distance
2010 IEEE Information Theory Workshop
Efficient sorting of genomic permutations by translocation, inversion and block interchange
Bioinformatics, 2005
An algebraic 1.375-approximation algorithm for the Transposition Distance Problem
arXiv (Cornell University), 2020
A new algorithm for generation of permutations
BIT, 1984
Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings
IEEE Transactions on Information Theory, 2000
Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
IEICE Transactions on Information and Systems, 2013
An Algorithamic Approach to Permutation Graphs and Its Complexities LathaMohanan
Asian Resonance, 2014
New bounds and tractable instances for the transposition distance
2006
研究報告アルゴリズム（AL）, 2009
Branch-and-bound algorithms for the problem of sorting by transpositions
2006
Sorting Signed Permutations by Reversal (Reversal Distance)
Encyclopedia of Algorithms, 2008
Efficient computations ofℓ1 andℓ∞ rearrangement distances
Theoretical Computer Science, 2009
A new tight upper bound on the transposition distance
Algorithms in Bioinformatics, 2005
A compact data structure and parallel algorithms for permutation graphs
Lecture Notes in Computer Science, 1995
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Malaysian Journal of Fundamental and Applied Sciences, 2014
Characterization and Construction of Permutation Graphs
Open Journal of Discrete Mathematics, 2013
Faster backtracking algorithms for the generation of symmetry-invariant permutations
Journal of Applied Mathematics, 2002
A Comparative Study on the Performance of Permutation Algorithms
2012
A k-cube graph construction for mappings from Binary vectors to permutations
2009 IEEE International Symposium on Information Theory, 2009
Algorithms for Pattern Involvement In Permutations
Algorithms and Computation, 2001
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms, 2008