The following pages link to Algorithms – ESA 2004 (Q5464599):
Displaying 24 items.
- Generalized coarse matching (Q516979) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- Parameterized matching on non-linear structures (Q989510) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Alphabet dependence in parameterized matching (Q1318756) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- Permuted function matching (Q1675783) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Towards a real time algorithm for parameterized longest common prefix computation (Q2220836) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Almost exact matchings (Q2429356) (← links)
- (Q2957901) (← links)
- (Q4635971) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
- Sublinear Algorithms for Parameterized Matching (Q5307519) (← links)
- Combinatorial Pattern Matching (Q5713549) (← links)
- (Q6065473) (← links)
