Pages that link to "Item:Q1029026"
From MaRDI portal
The following pages link to Sparse LCS common substring alignment (Q1029026):
Displaying 8 items.
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- (Q5090981) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
