Pattern matching between two non-aligned random sequences

DOI10.1007/BF02460290MaRDI QIDQ1340810zbMATH OpenWikidataFDO

Authors Ke-Ning Sheng, Joseph Naus

Publication date 29 June 1995

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

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

zbMATH Keywords

approximationsboundsDNA sequencesgeneralized matchingindependent sequences of letterslength of the longest matching wordmolecular biology

Mathematics Subject Classification ID

Combinatorial probability (60C05) General biology and biomathematics (92B05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Recommendations

• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
• scientific article; zbMATH DE number 850337
• An extreme value theory for sequence matching
• Long match patterns in random sequences
• A probabilistic analysis of a pattern matching problem

Cites work

• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
• An extreme value theory for long head runs
• An extreme value theory for sequence matching
• An upper bound for the probability of a union
• Approximations for Distributions of Scan Statistics
• Counts of long aligned word matches among random letter sequences
• Extreme order statistics for a sequence of dependent random variables
• scientific article; zbMATH DE number 50805 (Why is no real title available?)
• Locating a changed segment in a sequence of Bernoulli variables
• Maximal length of common words among random letter sequences
• Poisson approximation for dependent trials
• Probabilities for a Generalized Birthday Problem
• Subset complement addition upper bounds. An improved inclusion-exclusion method
• The Erdős-Rényi law in distribution, for coin tossing and sequence matching
• Tight bounds and approximations for scan statistic probabilities for discrete data

Cited in

(12)

• Matching among multiple random sequences
• Matching fixed rectangles in 2-dimension
• Long match patterns in random sequences
• A probabilistic analysis of a pattern matching problem
• String Matching for the Novice
• scientific article; zbMATH DE number 1405928 (Why is no real title available?)
• Exact probability of fixed patterns occurring in a random sequence
• Patterns and alignments in random chains.
• Bonferroni-type inequalities for conditional scan statistics
• A new method of approximating the probability of matching common words in multiple random sequences
• A martingale approach to scan statistics
• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences

This page was built for publication: Pattern matching between two non-aligned random sequences

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