Approximate word matches between two random sequences

DOI10.1214/07-AAP452zbMath1141.60013arXiv0801.3145MaRDI QIDQ2476396

Susan R. Wilson, Conrad J. Burden, Miriam Ruth Kantorovitz

Publication date: 19 March 2008

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

Full work available at URL: https://arxiv.org/abs/0801.3145

zbMATH Keywords

central limit theoremDNA sequencessequence comparisonword matchesnumber of \(m\)-letter word matches

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Functional limit theorems; invariance principles (60F17)

Related Items

Indifference pricing for CRRA utilities ⋮ Limit distributions of extremal distances to the nearest neighbor ⋮ Extraction of high quality \(k\)-words for alignment-free sequence comparison ⋮ New powerful statistics for alignment-free sequence comparison under a pattern transfer model ⋮ Statistical considerations underpinning an alignment-free sequence comparison method ⋮ Empirical distribution of \(k\)-word matches in biological sequences

Uses Software

• d2_cluster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• Poisson approximation for dependent trials
• Compound Poisson approximation: A user's guide
• Asymptotic Behavior of k-Word Matches Between two Uniformly Distributed Sequences
• Distributional regimes for the number of k -word matches between two random sequences