Pages that link to "Item:Q5248473"
From MaRDI portal
The following pages link to A theory of parameterized pattern matching (Q5248473):
Displaying 36 items.
- The structural border array (Q396695) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Alphabet dependence in parameterized matching (Q1318756) (← links)
- Overlap matching. (Q1401926) (← links)
- Permuted function matching (Q1675783) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Position heaps for Cartesian-tree matching on strings and tries (Q2146147) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- Online parameterized dictionary matching with one gap (Q2207509) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Parameterized dictionary matching and recognition with one gap (Q2220853) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Succinct non-overlapping indexing (Q2285052) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Order-preserving matching (Q2437748) (← links)
- Generalized function matching (Q2466014) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- The parameterized suffix tray (Q2692728) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
- A Filtering Technique for All Pairs Approximate Parameterized String Matching (Q5114858) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- (Q5140763) (← links)
