Matching among multiple random sequences
From MaRDI portal
Publication:1363031
DOI10.1007/BF02459461zbMATH Open0896.92014OpenAlexW4240605315MaRDI QIDQ1363031FDOQ1363031
Authors: Joseph 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
Recommendations
- A new method of approximating the probability of matching common words in multiple random sequences
- An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
- Compression and approximate matching
- Distribution of the number of matches between nucleotide sequences
- Pattern matching between two non-aligned random sequences
Cites Work
- Counts of long aligned word matches among random letter sequences
- Tight bounds and approximations for scan statistic probabilities for discrete data
- Maximal length of common words among random letter sequences
- 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
- Pattern matching between two non-aligned random sequences
- Title not available (Why is that?)
- Screening for unusual matched segments in multiple protein sequences
Cited In (5)
- Set intersection and sequence matching with mismatch counting
- A new method of approximating the probability of matching common words in multiple random sequences
- Power analysis of database search using multiple scoring matrices
- A martingale approach to scan statistics
- Common Substrings in Random Strings
This page was built for publication: Matching among multiple random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363031)
