Asymptotic Behavior of <i>k</i>-Word Matches Between two Uniformly Distributed Sequences (Q5440649): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compound Poisson approximation: A user's guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for dependent trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributional regimes for the number of <i>k</i> -word matches between two random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315008 / rank
 
Normal rank

Latest revision as of 15:22, 27 June 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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references