Asymptotic Behavior of k-Word Matches Between two Uniformly Distributed Sequences

DOI10.1239/jap/1189717545zbMath1144.62012OpenAlexW2022842463MaRDI QIDQ5440649

Susan R. Wilson, Conrad J. Burden, Miriam Ruth Kantorovitz, Hilary S. Booth

Publication date: 5 February 2008

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1189717545

zbMATH Keywords

Stein's methodsequence comparison\(k\)-word matchescount vector

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Applications of statistics to biology and medical sciences; meta analysis (62P10) Protein sequences, DNA sequences (92D20) Limit theorems in probability theory (60F99)

Related Items (4)

Stein's method for functions of multivariate normal random variables ⋮ Approximate word matches between two random sequences ⋮ New powerful statistics for alignment-free sequence comparison under a pattern transfer model ⋮ Statistical considerations underpinning an alignment-free sequence comparison method

Uses Software

• d2_cluster

Cites Work

• Poisson approximation for dependent trials
• Compound Poisson approximation: A user's guide
• Distributional regimes for the number of k -word matches between two random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic Behavior of k-Word Matches Between two Uniformly Distributed Sequences