Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Efficient algorithms for the block edit problems
Information and Computation
Minimum common string partition revisited
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Scaffold filling under the breakpoint distance
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Filling scaffolds with gene repetitions: maximizing the number of adjacencies
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Quick greedy computation for minimum common string partitions
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Exponential and polynomial time algorithms for the minimum common string partition problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
MEDITE: a unilingual textual aligner
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Minimum common string partition revisited
Journal of Combinatorial Optimization
Hi-index | 0.89 |