Pages that link to "Item:Q266804"
From MaRDI portal
The following pages link to Polynomial-time approximation algorithms for weighted LCS problem (Q266804):
Displaying 7 items.
- A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- (Q5090981) (← links)
- Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256) (← links)
- Weighted LCS (Q5901140) (← links)
- Weighted shortest common supersequence problem revisited (Q6536257) (← links)