Pages that link to "Item:Q5458540"
From MaRDI portal
The following pages link to A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant (Q5458540):
Displaying 6 items.
- Variants of constrained longest common subsequence (Q407588) (← links)
- A linear space algorithm for the LCS problem (Q1101217) (← links)
- A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
- A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749) (← links)
- A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608) (← links)
- Repetition-free longest common subsequence (Q5901069) (← links)