Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

On the distribution of k-tuple matches for sequence homology: a constant time exact calculation of the variance.

Journal of computational biology : a journal of computational molecular cell biology - 1 Jan 1998

Benson G, Su X

Abstract excerpt

We study the distribution of a statistic useful in calculating the significance of the number of k-tuple matches detected in biological sequence homology algorithms. The statistic is Rn,k, the total number of heads in head runs of length k or more in a sequence of iid Bernoulli trials of length n. Calculation of the mean is straightforward. Poisson approximation formulas have been used for the variance because...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to DNA
Share to Markov Chains

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Mutation

Share to Probability

Share to Repetitive Sequences, Nucleic Acid

Share to Sequence Homology, Amino Acid

Share to Statistics as Topic

Source

Identifiers

PMID: 9541873
DOI: 10.1089/cmb.1998.5.87

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-07.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

On the distribution of k-tuple matches for sequence homology: a constant time exact calculation of the variance.PMID 9541873Read ↗

The Statistics of k-mers from a Sequence Undergoing a Simple Mutation Process Without Spurious Matches.Semantic proximity Read ↗

User-friendly algorithms for estimating completeness and diversity in randomized protein-encoding libraries.Semantic proximity Read ↗

A metric model of amino acid substitution.Semantic proximity Read ↗

The Statistics of Parametrized Syncmers in a Simple Mutation Process Without Spurious Matches.Semantic proximity Read ↗

Theory of local k-mer selection with applications to long-read alignment.Semantic proximity Read ↗

Basic local alignment search tool.Semantic proximity Read ↗

GLUE-IT and PEDEL-AA: new programmes for analyzing protein diversity in randomized libraries.Semantic proximity Read ↗

STAR: an algorithm to Search for Tandem Approximate Repeats.Semantic proximity Read ↗

Indexing k-mers in linear space for quality value compression.Semantic proximity Read ↗

Statistics of divergence times.Semantic proximity Read ↗

Sequence-specific minimizers via polar setsSemantic proximity Read ↗

Alignment of Single-Molecule Sequencing Reads by Enhancing the Accuracy and Efficiency of Locality-Sensitive HashingSemantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.