Pages that link to "Item:Q1318756"
From MaRDI portal
The following pages link to Alphabet dependence in parameterized matching (Q1318756):
Displaying 43 items.
- The structural border array (Q396695) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← 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)
- Dynamic dictionary matching in external memory (Q1275745) (← 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)
- Order-preserving pattern matching indeterminate strings (Q2105413) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← 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)
- Towards a real time algorithm for parameterized longest common prefix computation (Q2220836) (← 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)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Order-preserving matching (Q2437748) (← links)
- Periodicity and Repetitions in Parameterized Strings (Q3439251) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- (Q5088893) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
- (Q5140763) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6199197) (← links)