Of mice and men: algorithms for evolutionary distances between genomes with translocation

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

On the complexity and approximation of syntenic distance

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)

To cut…or not to cut (applications of comparative physical maps in molecular evolution)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Faster and simpler algorithm for sorting signed permutations by reversals

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

The complexity of gene placement

Proceedings of the tenth 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

Reconstructing an ancestral genome using minimum segments duplications and reversals

Journal of Computer and System Sciences - Computational biology 2002

An O(n2) algorithm for signed translocation

Journal of Computer and System Sciences - Special issue on bioinformatics II

On the complexity of unsigned translocation distance

Theoretical Computer Science

A 1.75-approximation algorithm for unsigned translocation distance

Journal of Computer and System Sciences

A (1.5 + ε)-Approximation Algorithm for Unsigned Translocation Distance

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Polynomial-Time Algorithm for Sorting by Generalized Translocations

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation

Constraint Programming Models for Transposition Distance Problem

BSB '09 Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology

Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization

RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics

Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

A new method to construct phylogenetic tree from proteins

SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization

An O(n3/2log(n)) algorithm for sorting by reciprocal translocations

Journal of Discrete Algorithms

An O(n3/2√log(n)) algorithm for sorting by reciprocal translocations

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

A 1.75-approximation algorithm for unsigned translocation distance

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

On sorting by translocations

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

Sorting by translocations via reversals theory

RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics

Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics

Heuristics for the Sorting by Length-Weighted Inversion Problem

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics

Sorting genomes by generalized translocations

Theoretical Computer Science