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
On the complexity and approximation of syntenic distance
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Formulations and hardness of multiple sorting by reversals
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Sorting permutations by tanspositions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Fast practical solution of sorting by reversals
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Algorithms for Finding Gene Clusters
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Experiments in Computing Sequences of Reversals
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences
On the similarity of sets of permutations and its applications to genome comparison
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A 2-approximation algorithm for sorting by prefix reversals
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Using permutation patterns for content-based phylogeny
PRIB'06 Proceedings of the 2006 international conference on Pattern Recognition in Bioinformatics
The distribution of inversion lengths in bacteria
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
| Hi-index | 0.00 |