Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Transposition Distance Based on the Algebraic Formalism
BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Edit Distances and Factorisations of Even Permutations
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
The average number of block interchanges needed to sort a permutation and a recent result of Stanley
Information Processing Letters
Interchange rearrangement: The element-cost model
Theoretical Computer Science
Efficient computations of l1 and l∞ rearrangement distances
Theoretical Computer Science
Approximate string matching with address bit errors
Theoretical Computer Science
An improved algorithm for sorting by block-interchanges based on permutation groups
Information Processing Letters
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Efficient computations of l1and l∞rearrangement distances
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Cycle detection and correction
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The problem of chromosome reincorporation in DCJ sorting and halving
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Approximate string matching with stuck address bits
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the Cost of Interchange Rearrangement in Strings
SIAM Journal on Computing
Weighted genomic distance can hardly impose a bound on the proportion of transpositions
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Approximate string matching with stuck address bits
Theoretical Computer Science
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A Lower Bound on the Transposition Diameter
SIAM Journal on Discrete Mathematics
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
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
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
String rearrangement metrics: a survey
Algorithms and Applications
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
The distribution of cycles in breakpoint graphs of signed permutations
Discrete Applied Mathematics
| Hi-index | 0.90 |