Fluctuations of the longest common subsequence in the asymmetric case of 2- and 3-letter alphabets (Q3412988)
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 5081356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fluctuations of the longest common subsequence in the asymmetric case of 2- and 3-letter alphabets |
scientific article; zbMATH DE number 5081356 |
Statements
3 January 2007
0 references
longest common subsequence
0 references
LCS, fluctuations
0 references
random string matching
0 references
first passage problems
0 references
graphs with correlated weights
0 references
0.8557551503181458
0 references
0.8207971453666687
0 references
0.8132288455963135
0 references
