Pages that link to "Item:Q4946707"
From MaRDI portal
The following pages link to Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima (Q4946707):
Displaying 5 items.
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- The set-set LCS problem (Q1825675) (← links)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
- Deposition and extension approach to find longest common subsequence for thousands of long sequences (Q2359328) (← links)