Computing a longest common subsequence for a set of strings (Q786541)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a longest common subsequence for a set of strings |
scientific article |
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
