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
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
Permutation Editing and Matching via Embeddings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
(1+epsilon)-Approximation of Sorting by Reversals and Transpositions
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
A new approximation algorithm for sorting of signed permutations
Journal of Computer Science and Technology
A 1.5-approximation algorithm for sorting by transpositions and transreversals
Journal of Computer and System Sciences - Special issue on bioinformatics II
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
Whole genome duplications, multi-break rearrangements, and genome halving problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-break rearrangements and chromosomal evolution
Theoretical Computer Science
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms
Expected number of breakpoints after t random reversals in genomes with duplicate genes
Discrete Applied Mathematics
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Block sorting: a characterization and some heuristics
Nordic Journal of Computing
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Signed genome rearrangement by reversals and transpositions: models and approximations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
Efficient sampling of transpositions and inverted transpositions for bayesian MCMC
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Faster algorithms for sorting by transpositions and sorting by block-interchanges
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Genome rearrangement in mitochondria and its computational biology
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Sorting by weighted reversals, transpositions, and inverted transpositions
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
The (conditional) matching preclusion for burnt pancake graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |