A Fast Longest Common Subsequence Algorithm for Similar Strings (Q3564851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Fast Longest Common Subsequence Algorithm for Similar Strings |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Longest Common Subsequence Algorithm for Similar Strings |
scientific article |
Statements
A Fast Longest Common Subsequence Algorithm for Similar Strings (English)
0 references
26 May 2010
0 references
algorithm
0 references
string
0 references
edit distance
0 references
longest common subsequence
0 references
suffix tree
0 references
lowest common ancestor
0 references
suffix array
0 references
longest common extension
0 references
dynamic programming
0 references
