Pages that link to "Item:Q5716750"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716750):
Displaying 8 items.
- Approximate string matching using a bidirectional index (Q294959) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- On spaced seeds for similarity search (Q1827801) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Efficient Algorithms for Shortest Partial Seeds in Words (Q5165605) (← links)
- Combinatorial Pattern Matching (Q5315339) (← links)
- Combinatorial Pattern Matching (Q5713536) (← links)