The design and analysis of algorithms
The design and analysis of algorithms
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
Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes
CPM '93 Proceedings of the 4th 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
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
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)
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
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
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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
Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improving inversion median computation using commuting reversals and cycle information
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Genome rearrangement algorithms for unsigned permutations with O(log n) singletons
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On sorting permutations by double-cut-and-joins
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Polynomial-time sortable stacks of burnt pancakes
Theoretical Computer Science
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
A 2-approximation algorithm for sorting by prefix reversals
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Rearrangement of noisy genomes
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |