Pages that link to "Item:Q673107"
From MaRDI portal
The following pages link to On finding minimal, maximal, and consistent sequences over a binary alphabet (Q673107):
Displaying 7 items.
- Approximability of constrained LCS (Q439929) (← links)
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Consistent subsequences and supersequences (Q671514) (← links)
- Minimum degree and density of binary sequences (Q709264) (← links)
- Maximal common subsequences and minimal common supersequences (Q1917072) (← links)
- On minimizing the lengths of checking sequences (Q3417008) (← links)
- Morse‐type information on palais‐smale sequences obtained by min‐max principles (Q4321628) (← links)