Bounding the expected length of longest common subsequences and forests (Q1293550): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002240000125 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988684690 / rank | |||
Normal rank | |||
Latest revision as of 20:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the expected length of longest common subsequences and forests |
scientific article |
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
