Bounding the expected length of longest common subsequences and forests (Q1293550)
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: Bounding the expected length of longest common subsequences and forests |
scientific article; zbMATH DE number 1309894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the expected length of longest common subsequences and forests |
scientific article; zbMATH DE number 1309894 |
Statements
Bounding the expected length of longest common subsequences and forests (English)
0 references
28 June 1999
0 references
two random sequences
0 references
Markov chains
0 references
0.8546123504638672
0 references
0.8369159698486328
0 references
0.8352184891700745
0 references
0.8296591639518738
0 references
