Pages that link to "Item:Q1168731"
From MaRDI portal
The following pages link to A longest common subsequence algorithm suitable for similar text strings (Q1168731):
Displaying 30 items.
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- An algorithm for distinguishing efficiently bit-strings by their subsequences (Q758204) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- A systolic array for the longest common subsequence problem (Q1066678) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← 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 bit-string longest-common-subsequence algorithm (Q1996891) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- (Q3143773) (← links)
- Faster STR-EC-LCS Computation (Q3297762) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- Calcul de la distance par les sous-mots (Q3780455) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
- (Q5090981) (← links)
- Longest common subsequences (Q5096874) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5389673) (← links)
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
