On the complexity and approximation of syntenic distance
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
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
Reconstructing a history of recombinations from a set of sequences
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A new approximation algorithm for sorting of signed permutations
Journal of Computer Science and Technology
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of unsigned translocation distance
Theoretical Computer Science
Edit distance with move operations
Journal of Discrete Algorithms
Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences
Signed genome rearrangement by reversals and transpositions: models and approximations
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Foundations and Trends in Databases
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
On the repeat-annotated phylogenetic tree reconstruction problem
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Rearrangement of noisy genomes
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Electronic Notes in Theoretical Computer Science (ENTCS)
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 0.01 |