Pages that link to "Item:Q1885904"
From MaRDI portal
The following pages link to Average complexity of exact and approximate multiple string matching (Q1885904):
Displayed 5 items.
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations (Q2576875) (← links)
- A weak approach to suffix automata simulation for exact and approximate string matching (Q2676468) (← links)
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME (Q3421849) (← links)