Pages that link to "Item:Q733720"

The following pages link to A new efficient algorithm for computing the longest common subsequence (Q733720):

Displaying 26 items.

• New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
• Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
• Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
• Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
• A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
• An efficient systolic algorithm for the longest common subsequence problem (Q1275339) (← links)
• Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
• An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
• A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints (Q1931428) (← links)
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
• A data structure for substring-substring LCS length queries (Q2118872) (← links)
• Computing the longest common almost-increasing subsequence (Q2166775) (← links)
• Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
• Palindromic subsequence automata and longest common palindromic subsequence (Q2363997) (← links)
• A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
• An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
• Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
• (Q3621522) (← links)
• (Q5090981) (← links)
• Computing longest common square subsequences (Q5140779) (← links)
• String Processing and Information Retrieval (Q5393943) (← links)
• A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)
• Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446) (← links)