The following pages link to Searching subsequences (Q2638800):
Displayed 17 items.
- Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
- Asynchronous trace-matching automata (Q466372) (← links)
- Missing pattern discovery (Q553949) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- Multi-subsequence searching (Q1583054) (← links)
- Directed acyclic subsequence graph -- overview (Q1827273) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- A practical algorithm to find the best subsequence patterns (Q1870541) (← links)
- On trace inclusion optimization problems (Q2247802) (← links)
- A survey of temporal data mining (Q2371224) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- The size of subsequence automaton (Q2566019) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)