Pages that link to "Item:Q1915502"
From MaRDI portal
The following pages link to Parameterized pattern matching: Algorithms and applications (Q1915502):
Displaying 44 items.
- Order-preserving indexing (Q294954) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Palindrome pattern matching (Q390901) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications (Q497185) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Parameterized matching with mismatches (Q924551) (← 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)
- Comparison and evaluation of code clone detection techniques and tools: A qualitative approach (Q1021479) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- Position heaps for Cartesian-tree matching on strings and tries (Q2146147) (← links)
- Towards a real time algorithm for parameterized longest common prefix computation (Q2220836) (← links)
- Simpler FM-index for parameterized string matching (Q2224844) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Secure parameterized pattern matching (Q2663480) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- The parameterized suffix tray (Q2692728) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Palindrome Pattern Matching (Q3011857) (← 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)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- A Filtering Technique for All Pairs Approximate Parameterized String Matching (Q5114858) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- (Q6065473) (← links)
- Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6199197) (← links)
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets (Q6536267) (← links)
- Efficient parameterized pattern matching in sublinear space (Q6545436) (← links)
