Pages that link to "Item:Q963324"

The following pages link to New efficient algorithms for the LCS and constrained LCS problems (Q963324):

Displaying 19 items.

• The constrained shortest common supersequence problem (Q396654) (← links)
• Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
• Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
• Approximability of constrained LCS (Q439929) (← links)
• 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 new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
• Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
• Computing the longest common almost-increasing subsequence (Q2166775) (← links)
• An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
• Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
• The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
• A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
• An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
• An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
• Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
• (Q5140779) (← links)
• AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS (Q5187851) (← links)