Pages that link to "Item:Q932321"
From MaRDI portal
The following pages link to Algorithms for computing variants of the longest common subsequence problem (Q932321):
Displaying 7 items.
- Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- Finding the gapped longest common subsequence by incremental suffix maximum queries (Q2252523) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- Hardness and approximation of multiple sequence alignment with column score (Q2682925) (← links)
