The following pages link to The string merging problem (Q1154285):
Displaying 8 items.
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- Searching subsequences (Q2638800) (← links)
