An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
From MaRDI portal
Publication:920873
DOI10.1007/BF02460808zbMath0708.92016WikidataQ45120708 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)
approximation; distribution of the length of the longest matching word; non-independence of neighbouring bases; random DNA sequences; sequential similarities
60C05: Combinatorial probability
92C40: Biochemistry, molecular biology
92D20: Protein sequences, DNA sequences
Related Items
Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons, Pattern matching between two non-aligned random sequences, Matching among multiple random sequences, On the tail probability of the longest well-matching run.