On the asymptotic average length of a maximum common subsequence for words over a finite alphabet (Q671435)
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: On the asymptotic average length of a maximum common subsequence for words over a finite alphabet |
scientific article; zbMATH DE number 983300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the asymptotic average length of a maximum common subsequence for words over a finite alphabet |
scientific article; zbMATH DE number 983300 |
Statements
On the asymptotic average length of a maximum common subsequence for words over a finite alphabet (English)
0 references
27 February 1997
0 references
asymptotic behaviour
0 references
average length
0 references
subsequence of words
0 references
0 references
0.90708566
0 references
0.9044417
0 references
0.90038776
0 references
0.89818513
0 references
0.89164704
0 references
0.88382137
0 references
0.8828258
0 references
0.88216996
0 references
