Approximate string-matching with q-grams and maximal matches

Esko Ukkonen

doi:10.1016/0304-3975(92)90143-4

ScienceGate Book Chapters

JOURNAL ARTICLE

Approximate string-matching with q-grams and maximal matches

Esko Ukkonen

Year: 1992 Journal: Theoretical Computer Science Vol: 92 (1)Pages: 191-211 Publisher: Elsevier BV

DOI: 10.1016/0304-3975(92)90143-4

Get Full-Text PDF Get Analytical Report

Keywords:

Substring Edit distance String searching algorithm Approximate string matching Combinatorics String (physics) Mathematics Matching (statistics) String metric Pattern matching Upper and lower bounds Function (biology) Connection (principal bundle) Time complexity Discrete mathematics Algorithm Data structure Computer science Statistics Geometry Mathematical analysis Artificial intelligence

Metrics

611

Cited By

9.91

FWCI (Field Weighted Citation Impact)

Refs

0.98

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

Natural Language Processing Techniques

Physical Sciences → Computer Science → Artificial Intelligence

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

Approximate string-matching with q-grams and maximal matches

Metrics

Citation History

Topics

Related Documents

Multipattern string matching with q -grams

Improved Approximate Multiple Pattern String Matching using Consecutive Q Grams of Pattern

Filtration with q-samples in approximate string matching

Q-Grams Suffix Type Single Pattern String Matching Algorithms

Improved Approximate Multiple-Pattern String Matching using Consecutive N-Grams