Pages that link to "Item:Q2447542"

The following pages link to An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542):

Displaying 7 items.

• Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
• On the generalized constrained longest common subsequence problems (Q491203) (← links)
• Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
• A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
• A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (Q2357383) (← links)
• A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
• LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)