Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
Formulations and hardness of multiple sorting by reversals
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Fast practical solution of sorting by reversals
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Gossip is synteny: incomplete gossip and the syntenic distance between genomes
Journal of Algorithms
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Permutation Editing and Matching via Embeddings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Sorting by Prefix Transpositions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Structural Properties and Tractability Results for Linear Synteny
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
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
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
On sorting permutations by double-cut-and-joins
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Alignment with non-overlapping inversions in O(n3)-time
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
A 1.75-approximation algorithm for unsigned translocation distance
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |