Formulations and hardness of multiple sorting by reversals

Early eukaryote evolution based on mitochondrial gene order breakpoints

RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology

Steps toward accurate reconstructions of phylogenies from gene-order data

Journal of Computer and System Sciences - Computational biology 2002

Efficient algorithms for multichromosomal genome rearrangements

Journal of Computer and System Sciences - Computational biology 2002

On the Practical Solution of the Reversal Median Problem

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics

Finding an Optimal Inversion Median: Experimental Results

WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics

Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics

A Lower Bound for the Breakpoint Phylogeny Problem

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Approximating Bounded Degree Instances of NP-Hard Problems

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

Genomic distances under deletions and insertions

Theoretical Computer Science - Special papers from: COCOON 2003

On the tandem duplication-random loss model of genome rearrangement

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Reversal and transposition medians

Theoretical Computer Science

Multiple genome rearrangement by swaps and by element duplications

Theoretical Computer Science

A linear time algorithm for the inversion median problem in circular bacterial genomes

Journal of Discrete Algorithms

An efficient probabilistic population-based descent for the median genome problem

Proceedings of the 10th annual conference on Genetic and evolutionary computation

Approximating the true evolutionary distance between two genomes

Journal of Experimental Algorithmics (JEA)

A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics

Genomic distances under deletions and insertions

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Improving tree search in phylogenetic reconstruction from genome rearrangement data

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Improving inversion median computation using commuting reversals and cycle information

RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics

A heuristic algorithm for reconstructing ancestral gene orders with duplications

RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics

Recovering true rearrangement events on phylogenetic trees

RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics

Homology prediction refinement and reconstruction of gene content and order of ancestral bacterial genomes

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology

The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths

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

On the repeat-annotated phylogenetic tree reconstruction problem

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

Quartet-based phylogeny reconstruction from gene orders

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

The median problem for the reversal distance in circular bacterial genomes

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Linear programming for phylogenetic reconstruction based on gene rearrangements

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Perfect sorting by reversals is not always difficult

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

Using permutation patterns for content-based phylogeny

PRIB'06 Proceedings of the 2006 international conference on Pattern Recognition in Bioinformatics

A PQ framework for reconstructions of common ancestors and phylogeny

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

Conservation of combinatorial structures in evolution scenarios

RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics

Evolution of genome organization by duplication and loss: an alignment approach

RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology