A longest common subsequence algorithm suitable for similar text strings (Q1168731): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A longest common subsequence algorithm suitable for similar text strings |
scientific article |
Statements
A longest common subsequence algorithm suitable for similar text strings (English)
0 references
1982
0 references
