scientific article; zbMATH DE number 176144

zbMATH Open0776.68047MaRDI QIDQ4035246FDOQ4035246

Authors: Petteri Jokinen, Esko Ukkonen 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1303588
• Approximate String Matching: A Simpler Faster Algorithm
• Approximate string matching with suffix automata
• Finding approximate patterns in strings
• scientific article; zbMATH DE number 3845091

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)

Cited In (15)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035246)