Pages that link to "Item:Q942990"

The following pages link to Semi-local string comparison: algorithmic techniques and applications (Q942990):

Displaying 23 items.

• A fast algorithm for multiplying min-sum permutations (Q411869) (← links)
• Monge properties of sequence alignment (Q418004) (← links)
• Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
• Faster subsequence recognition in compressed strings (Q843615) (← links)
• An algorithm for solving the longest increasing circular subsequence problem (Q987842) (← links)
• Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
• On almost Monge all scores matrices (Q1755777) (← links)
• Comparison of strings belonging to the same family (Q1818790) (← links)
• Longest common rollercoasters (Q2146120) (← links)
• A faster reduction of the dynamic time warping distance to the longest increasing subsequence length (Q2165031) (← links)
• Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
• An almost quadratic time algorithm for sparse spliced alignment (Q2429729) (← links)
• Efficient all path score computations on grid graphs (Q2437757) (← links)
• Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
• Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
• Periodic String Comparison (Q3637113) (← links)
• (Q5009573) (← links)
• (Q5091741) (← links)
• Finding top-\(k\) longest palindromes in substrings (Q6057835) (← links)
• (Q6065395) (← links)
• Longest bordered and periodic subsequences (Q6161459) (← 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)