Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Proceedings of the 27th International Conference on Very Large Data Bases
An Improved Algorithm for Sequence Comparison with Block Reversals
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Simple and Practical Sequence Nearest Neighbors with Block Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Text joins in an RDBMS for web data integration
WWW '03 Proceedings of the 12th international conference on World Wide Web
An efficient algorithm for sequence comparison with block reversals
Theoretical Computer Science - Latin American theorotical informatics
Schema Matching Using Duplicates
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms (TALG)
The greedy algorithm for edit distance with moves
Information Processing Letters
Edit distance with move operations
Journal of Discrete Algorithms
An extension of the Burrows–Wheeler Transform
Theoretical Computer Science
Distance measures for biological sequences: Some recent approaches
International Journal of Approximate Reasoning
Information Processing Letters
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
A data structure for representing multi-version texts online
International Journal of Human-Computer Studies
Fluency, adequacy, or HTER?: exploring different human judgments with a tunable MT metric
StatMT '09 Proceedings of the Fourth Workshop on Statistical Machine Translation
The greedy algorithm for edit distance with moves
Information Processing Letters
Efficient algorithms for the block edit problems
Information and Computation
Edit distances with block movements and error rate confidence estimates
Machine Translation
A novel greedy algorithm for the minimum common string partition problem
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Exploiting content redundancy for web information extraction
Proceedings of the VLDB Endowment
Quick greedy computation for minimum common string partitions
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Fast computation of a string duplication history under no-breakpoint-reuse
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
MEDITE: a unilingual textual aligner
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Alignments with non-overlapping moves, inversions and tandem duplications in O(n4) time
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
The parallel path framework for entity discovery on the web
ACM Transactions on the Web (TWEB)
Hi-index | 0.00 |