Enumeration of maximal common subsequences between two strings (Q2118209)
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 7495495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of maximal common subsequences between two strings |
scientific article; zbMATH DE number 7495495 |
Statements
Enumeration of maximal common subsequences between two strings (English)
0 references
22 March 2022
0 references
maximal common subsequence
0 references
subsequence
0 references
LCS
0 references
enumeration
0 references
polynomial-delay
0 references
0 references
0 references
0.8429452180862427
0 references
0.8413919806480408
0 references
0.8031945824623108
0 references
0.8031945824623108
0 references
