An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences

DOI10.1007/BF02460808zbMath0708.92016OpenAlexW2049672539WikidataQ45120708 ScholiaQ45120708MaRDI QIDQ920873

R. F. Mott, R. N. Curnow, Thomas B. L. Kirkwood

Publication date: 1990

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

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

zbMATH Keywords

approximationdistribution of the length of the longest matching wordnon-independence of neighbouring basesrandom DNA sequencessequential similarities

Mathematics Subject Classification ID

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

Related Items (6)

Exact probability of fixed patterns occurring in a random sequence ⋮ Pattern matching between two non-aligned random sequences ⋮ Matching among multiple random sequences ⋮ On the tail probability of the longest well-matching run. ⋮ Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons ⋮ Maximum-likelihood estimation of the statistical distribution of Smith- Waterman local sequence similarity scores

Cites Work

• Unnamed Item
• An Erdős-Rényi law with shifts
• An extreme value theory for sequence matching
• Significance levels for biological sequence comparison using non-linear similarity functions
• Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
• New approaches for computer analysis of nucleic acid sequences.

This page was built for publication: An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences