Computing a longest common subsequence for a set of strings (Q786541)
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: Computing a longest common subsequence for a set of strings |
scientific article; zbMATH DE number 3839338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a longest common subsequence for a set of strings |
scientific article; zbMATH DE number 3839338 |
Statements
Computing a longest common subsequence for a set of strings (English)
0 references
1984
0 references
24, 45-59 (1984)
0 references
longest common subsequence
0 references
analysis of algorithms
0 references
string merging
0 references
