Pages that link to "Item:Q1101217"
From MaRDI portal
The following pages link to A linear space algorithm for the LCS problem (Q1101217):
Displaying 17 items.
- Linear-space best-first search (Q685539) (← links)
- An algorithm for distinguishing efficiently bit-strings by their subsequences (Q758204) (← links)
- An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737) (← links)
- Space reduction and an extension for a hidden line elimination algorithm (Q1126253) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- Simple and fast linear space computation of longest common subsequences (Q1583368) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
- (Q3143773) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
- Longest common subsequences (Q5096874) (← links)
- Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256) (← links)
- A solution to the L space problem (Q5469252) (← links)
- Move schedules: fast persistence computations in coarse dynamic settings (Q6589170) (← links)
