Pages that link to "Item:Q3506928"
From MaRDI portal
The following pages link to Algorithms for Computing the Longest Parameterized Common Subsequence (Q3506928):
Displaying 20 items.
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints (Q1931428) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Finding the gapped longest common subsequence by incremental suffix maximum queries (Q2252523) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (Q2502283) (← links)
- Hardness and approximation of multiple sequence alignment with column score (Q2682925) (← links)
- (Q2970219) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- (Q3621522) (← links)
- (Q5090981) (← links)
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)
