The following pages link to Diptarama Hendrian (Q782169):
Displaying 15 items.
- Generalized dictionary matching under substring consistent equivalence relations (Q782170) (← links)
- Enumeration of cryptarithms using deterministic finite automata (Q1616985) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Linear-time online algorithm for inferring the shortest path graph from a walk label (Q2297861) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching (Q3297770) (← links)
- (Q5020531) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- In-place bijective burrows-wheeler transforms (Q5874450) (← links)
- DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures (Q5874456) (← links)
- Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences (Q6487606) (← links)
- Parallel algorithm for pattern matching problems under substring consistent equivalence relations (Q6496858) (← links)
