scientific article

zbMath0776.68047MaRDI QIDQ4035246

Petteri Jokinen, Esko Ukkonen

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

preprocessingapproximate occurrencessuffix automata\(q\)-gram lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (14)

Approximate string matching using compressed suffix arrays ⋮ A metric index for approximate string matching ⋮ Boyer-Moore approach to approximate string matching ⋮ On pattern occurrences in a random text ⋮ Compact q-gram profiling of compressed strings ⋮ Approximate all-pairs suffix/prefix overlaps ⋮ Improved approximate string matching using compressed suffix data structures ⋮ Approximate string-matching with \(q\)-grams and maximal matches ⋮ A randomized numerical aligner (rNA) ⋮ Pattern statistics and Vandermonde matrices. ⋮ Index structures for fast similarity search for symbol strings ⋮ Alphabet indexing for approximating features of symbols ⋮ What’s Behind Blast ⋮ Indexing text with approximate \(q\)-grams

This page was built for publication: