Gossip is synteny: incomplete gossip and the syntenic distance between genomes
Journal of Algorithms
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
New Bounds and Tractable Instances for the Transposition Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions
BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Block sorting: a characterization and some heuristics
Nordic Journal of Computing
Constraint Programming Models for Transposition Distance Problem
BSB '09 Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Prefix reversals on binary and ternary strings
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Bounds on the transposition distance for lonely permutations
BSB'10 Proceedings of the Advances in bioinformatics and computational biology, and 5th Brazilian conference on Bioinformatics
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions
SIAM Journal on Discrete Mathematics
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A Lower Bound on the Transposition Diameter
SIAM Journal on Discrete Mathematics
Faster algorithms for sorting by transpositions and sorting by block-interchanges
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
A 1.375-approximation algorithm for sorting by transpositions
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A new tight upper bound on the transposition distance
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A (1+ε)-approximation algorithm for sorting by short block-moves
Theoretical Computer Science
A new and faster method of sorting by transpositions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Prefix transpositions on binary and ternary strings
Information Processing Letters
| Hi-index | 0.05 |