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
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
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Edit Distances for Genome Comparisons Based on Non-Local Operations
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Efficient Bounds for Oriented Chromosome Inversion Distance
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Formulations and hardness of multiple sorting by reversals
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Probability models for genome rearrangement and linear invariants for phylogenetic inference
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)
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth 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
Estimating true evolutionary distances between genomes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Reconstructing an ancestral genome using minimum segments duplications and reversals
Journal of Computer and System Sciences - Computational biology 2002
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Evolutionary Puzzles: An Introduction to Genome Rearrangement
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
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
(1+epsilon)-Approximation of Sorting by Reversals and Transpositions
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
An O(n2) algorithm for signed translocation
Journal of Computer and System Sciences - Special issue on bioinformatics II
Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Multiple genome rearrangement by swaps and by element duplications
Theoretical Computer Science
Topological Morphing of Planar Graphs
Graph Drawing
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
O(1)-time unsorting by prefix-reversals in a boustrophedon linked list
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
On the repeat-annotated phylogenetic tree reconstruction problem
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Using permutation patterns for content-based phylogeny
PRIB'06 Proceedings of the 2006 international conference on Pattern Recognition in Bioinformatics
Sorting by translocations via reversals theory
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 0.01 |