Computing a longest common subsequence for a set of strings (Q786541): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01934514 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003021193 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
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
