Asymptotic Behavior of <i>k</i>-Word Matches Between two Uniformly Distributed Sequences (Q5440649): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: d2_cluster / rank | |||
Normal rank | |||
Revision as of 14:38, 29 February 2024
scientific article; zbMATH DE number 5232354
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
