Pages that link to "Item:Q972350"

The following pages link to Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350):

Displaying 3 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)