An extreme value theory for sequence matching

DOI10.1214/AOS/1176350045MaRDI QIDQ1081998zbMATH OpenOpenAlexWikidataFDO

Authors Richard Arratia, Louis Gordon, Michael S. Waterman

Publication date 1986

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aos/1176350045

zbMATH Keywords

negative binomialDNA sequenceextreme value distributionbacteriophage lambdadistribution of the longest contiguous run of matches

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Asymptotic distribution theory in statistics (62E20) Genetics and epigenetics (92D10)

Recommendations

• scientific article; zbMATH DE number 3963627
• Long match patterns in random sequences
• A Poisson approximation for sequence comparisons with insertions and deletions
• Counts of long aligned word matches among random letter sequences
• Critical phenomena in sequence matching

Cited in

(21)

• General methods of sequence comparison
• Pattern matching between two non-aligned random sequences
• Critical phenomena in sequence matching
• A probabilistic approach to antigen-antibody recognition
• Asymptotics for local maximal stack scores with general loop penalty function
• A Probabilistic Analysis of a String Editing Problem and its Variations
• Extreme value theory in some statistical analysis of genomic sequences
• Approximate word matches between two random sequences
• A comparison of scores of two protein structures with foldings
• A Phase Transition for the Distribution of Matching Blocks
• scientific article; zbMATH DE number 3963627 (Why is no real title available?)
• On the tail probability of the longest well-matching run.
• Matching of observations of dynamical systems, with applications to sequence matching
• Significance levels for biological sequence comparison using non-linear similarity functions
• An Eulerian path approach to local multiple alignment for DNA sequences
• Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons
• Longest common substring for random subshifts of finite type
• Maximum-likelihood estimation of the statistical distribution of Smith- Waterman local sequence similarity scores
• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
• On the shortest distance between orbits and the longest common substring problem
• A nonlinear measure of subalignment similarity and its significance levels

This page was built for publication: An extreme value theory for sequence matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081998)