Pages that link to "Item:Q1041737"
From MaRDI portal
The following pages link to An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737):
Displaying 18 items.
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- A linear space algorithm for the LCS problem (Q1101217) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- An efficient systolic algorithm for the longest common subsequence problem (Q1275339) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- A linear-space algorithm for the substring constrained alignment problem (Q1796823) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- Maximal common subsequence algorithms (Q2326405) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
- Longest common subsequence in sublinear space (Q2656347) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- String Processing and Information Retrieval (Q5393947) (← links)
- String Processing and Information Retrieval (Q5897140) (← links)
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)
