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

The number of recombination events in a sample history: conflict graph and lower bounds.

IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000

Bafna Vineet, Bansal Vikas

Abstract excerpt

We consider the following problem: Given a set of binary sequences, determine lower bounds on the minimum number of recombinations required to explain the history of the sample, under the infinite-sites model of mutation. The problem has implications for finding recombination hotspots and for the...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Alcohol Dehydrogenase
Share to Computational Biology

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Drosophila melanogaster

Share to Evolution, Molecular

Share to Haplotypes

Share to Models, Genetic

Share to Recombination, Genetic

Source

Identifiers

PMID: 17048383
DOI: 10.1109/TCBB.2004.23

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 2 Sept 2026. Prepared record publication-17048383-2026-09-02.2. Manifest publication-graph-cohort-2026-09-02.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 2 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

The number of recombination events in a sample history: conflict graph and lower bounds.PMID 17048383Read ↗

On the minimum number of recombination events in the evolutionary history of DNA sequences.Semantic proximity Read ↗

Recoverability of ancestral recombination graph topologies.Semantic proximity Read ↗

Counting all possible ancestral configurations of sample sequences in population genetics.Semantic proximity Read ↗

Optimal, efficient reconstruction of phylogenetic networks with constrained recombination.Semantic proximity Read ↗

Algorithms to estimate the lower bounds of recombination with or without recurrent mutations.Semantic proximity Read ↗

Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution.Semantic proximity Read ↗

A Resolution of the Static Formulation Question for the Problem of Computing the History Bound.Semantic proximity Read ↗

Constructing founder sets under allelic and non-allelic homologous recombinationSemantic proximity Read ↗

Inferring genome-wide mosaic structure.Semantic proximity Read ↗

Recombination-filtered genomic datasets by information maximization.Semantic proximity Read ↗

Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations.Semantic proximity Read ↗

A simple and robust statistical test for detecting the presence of recombination.Semantic proximity Read ↗

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