Pages that link to "Item:Q1140994"
From MaRDI portal
The following pages link to A faster algorithm computing string edit distances (Q1140994):
Displayed 50 items.
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Fast searching in packed strings (Q533408) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- An algorithm for distinguishing efficiently bit-strings by their subsequences (Q758204) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- String matching with weighted errors (Q909451) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization (Q947943) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Shift-or string matching with super-alphabets (Q1014420) (← links)
- The constrained longest common subsequence problem (Q1029006) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Rational equivalence relations (Q1089801) (← links)
- The longest common subsequence problem revisited (Q1098310) (← links)
- Constrained string editing (Q1099954) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- The set LCS problem (Q1101215) (← links)
- A new distance metric on strings computable in linear time (Q1102764) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- Matching for run-length encoded strings (Q1288529) (← links)