A longest common subsequence algorithm suitable for similar text strings (Q1168731)
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 longest common subsequence algorithm suitable for similar text strings |
scientific article; zbMATH DE number 3776858
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A longest common subsequence algorithm suitable for similar text strings |
scientific article; zbMATH DE number 3776858 |
Statements
A longest common subsequence algorithm suitable for similar text strings (English)
0 references
1982
0 references
