PubMed · 7833847
Pattern matching between two non-aligned random sequences.
Abstract
Given two independent sequences of letters, we seek the probability distribution of the length of the longest matching word. This word can be in different positions in the two sequences and we consider both perfect and nearly perfect matching. We derive bounds and approximations for the probability and compare them with other bounds and approximations. The results can be applied to DNA sequences in molecular biology and generalized matching between two independent random sequences.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
K N Sheng, J I Naus. 1994. Pattern matching between two non-aligned random sequences.. https://doi.org/10.1007/bf02460290. https://searchpubmed.org/record/pubmed%3A7833847/pattern-matching-between-two-non-aligned-random-sequences
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search PubMed by Indiciae: BibTeX · RIS.