Pages that link to "Item:Q912628"
From MaRDI portal
The following pages link to An O(NP) sequence comparison algorithm (Q912628):
Displaying 8 items.
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Simple and fast linear space computation of longest common subsequences (Q1583368) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- (Q3143773) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- (Q5090981) (← links)
- Mining Bit-Parallel LCS-length Algorithms (Q5150933) (← links)
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
