Asymptotic Behavior of <i>k</i>-Word Matches Between two Uniformly Distributed Sequences (Q5440649)
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 5232354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic Behavior of <i>k</i>-Word Matches Between two Uniformly Distributed Sequences |
scientific article; zbMATH DE number 5232354 |
Statements
Asymptotic Behavior of <i>k</i>-Word Matches Between two Uniformly Distributed Sequences (English)
0 references
5 February 2008
0 references
Stein's method
0 references
count vector
0 references
\(k\)-word matches
0 references
sequence comparison
0 references
0 references
0.9453317
0 references
0.8884573
0 references
0.87617826
0 references
0.86258674
0 references
0.8604282
0 references
0.8568144
0 references
0.8555589
0 references
