Faster and simpler algorithm for sorting signed permutations by reversals
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)
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth 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
(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
Finding an Optimal Inversion Median: Experimental Results
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
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
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
CPM '01 Proceedings of the 12th 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
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Advances on sorting by reversals
Discrete Applied Mathematics
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Patterns of simple gene assembly in ciliates
Discrete Applied Mathematics
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Decision problem for shuffled genes
Information and Computation
Interchange Rearrangement: The Element-Cost Model
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
Interchange rearrangement: The element-cost model
Theoretical Computer Science
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
A new linear time algorithm to compute the genomic distance via the double cut and join distance
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics
How to achieve an equivalent simple permutation in linear time
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Efficient computations of l1and l∞rearrangement distances
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Cycle detection and correction
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Approximate string matching with stuck address bits
Theoretical Computer Science
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms
Simple operations for gene assembly
DNA'05 Proceedings of the 11th international conference on DNA Computing
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Matrix tightness: a linear-algebraic framework for sorting by transpositions
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
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
String rearrangement metrics: a survey
Algorithms and Applications
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences
Cycle detection and correction
ACM Transactions on Algorithms (TALG)
Approximate period detection and correction
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.01 |