Pages that link to "Item:Q1854526"
From MaRDI portal
The following pages link to Compact recognizers of episode sequences (Q1854526):
Displaying 11 items.
- A linear algorithm for string reconstruction in the reverse complement equivalence model (Q450544) (← links)
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern (Q544885) (← links)
- The subsequence composition of a string (Q732027) (← links)
- Multiple serial episodes matching (Q844201) (← links)
- On building minimal automaton for subset matching queries (Q1675873) (← links)
- An inexact-suffix-tree-based algorithm for detecting extensible patterns (Q1781986) (← links)
- Subsequence automata with default transitions (Q2363354) (← links)
- Avoiding cross-bifix-free binary words (Q2377303) (← links)
- Lower bounds of temporal and spatial complexity of the substring search problem (Q2629755) (← links)
- (Q4736067) (← links)
- Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)