Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons

DOI10.1007/BF02459930zbMath0769.92019OpenAlexW1995074239WikidataQ42612616 ScholiaQ42612616MaRDI QIDQ1194425

Michael S. Waterman, Larry Goldstein

Publication date: 27 September 1992

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02459930

zbMATH Keywords

compound PoissonPoisson approximationextreme value distributionsignificance testsdynamic programming approachapproximate distributionsdistribution of order statisticsDNA sequence comparisonslongest exact matching wordnull hypothesis of sequence independenceprotein sequence comparisonsword matches

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (10)

Kendall's tau-type rank statistics in genome data. ⋮ Scan statistic tail probability assessment based on process covariance and window size ⋮ On an alternative sequence comparison statistic of Steele ⋮ Approximations for discrete scan statistics on the circle ⋮ A local algorithm for DNA sequence alignment with inversions ⋮ An Improvement of Poisson Approximation for Sums of Dependent Bernoulli Random Variables ⋮ New non-uniform bounds on Poisson approximation for dependent Bernoulli trials ⋮ The exact distribution of the \(k\)-tuple statistic for sequence homology ⋮ p-values for the Discrete Scan Statistic through Slack Variables ⋮ A martingale approach to scan statistics

Uses Software

• FASTA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Rényi law in distribution, for coin tossing and sequence matching
• General methods of sequence comparison
• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
• An extreme value theory for sequence matching
• Étude des extrêmes d'une suite stationnaire m-dépendante avec une application relative aux accroissements du processus de Wiener. (Study of the extremes of a stationary m-dependent sequence with an application to the increments of Wiener processes)
• Tutorial on large deviations for the binomial distribution
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Probability approximations via the Poisson clumping heuristic
• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Poisson approximation and dna sequence matching
• Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
• New approaches for computer analysis of nucleic acid sequences.
• Counts of long aligned word matches among random letter sequences
• Stochastic scrabble: large deviations for sequences with scores

This page was built for publication: Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons