Pages that link to "Item:Q1391531"
From MaRDI portal
The following pages link to Matching a set of strings with variable length don't cares (Q1391531):
Displaying 17 items.
- A matching algorithm in PMWL based on CluTree (Q265007) (← links)
- An algorithm for string matching with a sequence of don't cares (Q750152) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Multi-subsequence searching (Q1583054) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- Online recognition of dictionary with one gap (Q2216131) (← links)
- Parameterized dictionary matching and recognition with one gap (Q2220853) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Mind the gap! (Q2414857) (← links)
- Is the string field big enough? (Q2719747) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
- Window-accumulated subsequence matching problem is linear (Q5957906) (← links)