Pages that link to "Item:Q972350"
From MaRDI portal
The following pages link to Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350):
Displaying 8 items.
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
