scientific article; zbMATH DE number 1490002
From MaRDI portal
Publication:4496245
zbMath0964.68078MaRDI QIDQ4496245
Cyril Allauzen, Mathieu Raffinot, Maxime Crochemore
Publication date: 13 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
Automata evaluation and text search protocols with simulation-based security ⋮ Substring search and repeat search using factor oracles ⋮ Fast exact string matching algorithms ⋮ Compact suffix automata representations for searching long patterns ⋮ Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ Converting suffix trees into factor/suffix oracles ⋮ Faster string matching based on hashing and bit-parallelism ⋮ Statistical properties of factor oracles ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms ⋮ Unnamed Item ⋮ Music and combinatorics on words: a historical survey ⋮ Creating improvisations on chord progressions using suffix trees ⋮ Finite Automata for Generalized Approach to Backward Pattern Matching ⋮ Fast string matching for DNA sequences ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Statistical Properties of Factor Oracles ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets ⋮ Average-optimal string matching ⋮ Parallel String Matching
This page was built for publication:
