Matching among multiple random sequences

DOI10.1007/BF02459461zbMath0896.92014OpenAlexW4240605315MaRDI QIDQ1363031

Joseph I. Naus, Ke-Ning Sheng

Publication date: 7 August 1997

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

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

zbMATH Keywords

protein sequencesmultiple alignmenthomologiesmultiple matches

Mathematics Subject Classification ID

Combinatorial probability (60C05) Biochemistry, molecular biology (92C40)

Related Items (2)

A new method of approximating the probability of matching common words in multiple random sequences ⋮ A martingale approach to scan statistics

Cites Work

• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
• Pattern recognition in several sequences: Consensus and alignment
• Maximal length of common words among random letter sequences
• Tight bounds and approximations for scan statistic probabilities for discrete data
• Pattern matching between two non-aligned random sequences
• Screening for unusual matched segments in multiple protein sequences
• Counts of long aligned word matches among random letter sequences
• Unnamed Item

This page was built for publication: Matching among multiple random sequences