Efficient algorithms for enumerating maximal common subsequences of two strings (Q6969918)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8054335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for enumerating maximal common subsequences of two strings |
scientific article; zbMATH DE number 8054335 |
Statements
Efficient algorithms for enumerating maximal common subsequences of two strings (English)
0 references
19 June 2025
0 references
longest common subsequence
0 references
maximal common subsequence
0 references
enumeration
0 references
0 references
0 references
