Compact recognizers of episode sequences
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- scientific article; zbMATH DE number 1044854 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Searching subsequences
- The longest common subsequence problem revisited
- The smallest automaton recognizing the subwords of a text
Cited in
(16)- scientific article; zbMATH DE number 1786453 (Why is no real title available?)
- scientific article; zbMATH DE number 2084855 (Why is no real title available?)
- scientific article; zbMATH DE number 2114411 (Why is no real title available?)
- Multiple serial episodes matching
- Near-optimal algorithm to count occurrences of subsequences of a given length
- Combinatorial algorithms for subsequence matching: a survey
- Lower bounds of temporal and spatial complexity of the substring search problem
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- An inexact-suffix-tree-based algorithm for detecting extensible patterns
- The subsequence composition of a string
- On building minimal automaton for subset matching queries
- Searching subsequences
- A linear algorithm for string reconstruction in the reverse complement equivalence model
- Avoiding cross-bifix-free binary words
- Window-accumulated subsequence matching problem is linear
- Subset Seed Automaton
This page was built for publication: Compact recognizers of episode sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854526)