Pages that link to "Item:Q733720"
From MaRDI portal
The following pages link to A new efficient algorithm for computing the longest common subsequence (Q733720):
Displaying 12 items.
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
- A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- (Q5090981) (← links)
- (Q5140779) (← links)
