Matching among multiple random sequences
From MaRDI portal
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
- scientific article; zbMATH DE number 4116365 (Why is no real title available?)
- An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
- Counts of long aligned word matches among random letter sequences
- Maximal length of common words among random letter sequences
- Pattern matching between two non-aligned random sequences
- Pattern recognition in several sequences: Consensus and alignment
- Screening for unusual matched segments in multiple protein sequences
- Tight bounds and approximations for scan statistic probabilities for discrete data
Cited in
(5)- A martingale approach to scan statistics
- Common Substrings in Random Strings
- A new method of approximating the probability of matching common words in multiple random sequences
- Power analysis of database search using multiple scoring matrices
- Set intersection and sequence matching with mismatch counting
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)
