Pattern matching between two non-aligned random sequences
From MaRDI portal
Publication:1340810
DOI10.1007/BF02460290zbMath0816.92011WikidataQ52367694 ScholiaQ52367694MaRDI QIDQ1340810
Publication date: 29 June 1995
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
boundsapproximationsDNA sequencesmolecular biologygeneralized matchingindependent sequences of letterslength of the longest matching word
Combinatorial probability (60C05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) General biology and biomathematics (92B05)
Related Items (5)
Exact probability of fixed patterns occurring in a random sequence ⋮ Matching among multiple random sequences ⋮ Matching fixed rectangles in 2-dimension ⋮ Bonferroni-type inequalities for conditional scan statistics ⋮ A martingale approach to scan statistics
Cites Work
- Unnamed Item
- The Erdős-Rényi law in distribution, for coin tossing and sequence matching
- Subset complement addition upper bounds. An improved inclusion-exclusion method
- 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
- Maximal length of common words among random letter sequences
- Tight bounds and approximations for scan statistic probabilities for discrete data
- Poisson approximation for dependent trials
- Extreme order statistics for a sequence of dependent random variables
- Locating a changed segment in a sequence of Bernoulli variables
- Counts of long aligned word matches among random letter sequences
- Approximations for Distributions of Scan Statistics
- Probabilities for a Generalized Birthday Problem
- An upper bound for the probability of a union
This page was built for publication: Pattern matching between two non-aligned random sequences
