Pages that link to "Item:Q786541"

The following pages link to Computing a longest common subsequence for a set of strings (Q786541):

Displaying 16 items.

• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
• A hyper-heuristic for the longest common subsequence problem (Q441749) (← links)
• Automatic error correction in flexion languages (Q805262) (← links)
• Beam search for the longest common subsequence problem (Q833536) (← links)
• A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
• An improved algorithm for the longest common subsequence problem (Q1762001) (← links)
• Directed acyclic subsequence graph -- overview (Q1827273) (← links)
• Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
• Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
• RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
• A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
• Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
• Searching subsequences (Q2638800) (← links)
• On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
• Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)