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 minimum number of recombination events in the evolutionary history of DNA sequences.

Journal of mathematical biology - 1 Feb 2004

Song Yun S, Hein Jotun

Abstract excerpt

In representing the evolutionary history of a set of binary DNA sequences by a connected graph, a set theoretical approach is introduced for studying recombination events. We show that set theoretical constraints have direct implications on the number of recombination events. We define a new lower bound on the number of recombination events and demonstrate the usefulness of our new approach through several...

Read the complete abstract on PubMed

Topics

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

Share to Alcohol Dehydrogenase
Share to Algorithms
Share to DNA

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Drosophila melanogaster

Share to Evolution, Molecular

Share to Models, Genetic

Share to Recombination, Genetic

Share to Software

Source

Identifiers

PMID: 14745509
DOI: 10.1007/s00285-003-0227-5

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 2 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

On the minimum number of recombination events in the evolutionary history of DNA sequences.PMID 14745509Read ↗

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

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

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

Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion.Semantic proximity Read ↗

Reconciliation of gene and species trees.Semantic proximity Read ↗

Recoverability of ancestral recombination graph topologies.Semantic proximity Read ↗

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

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

Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.Semantic proximity Read ↗

Network analyses structure genetic diversity in independent genetic worlds.Semantic proximity Read ↗

A review of evolutionary graph theory with applications to game theory.Semantic proximity Read ↗

Inferring phylogenetic trees from the knowledge of rare evolutionary events.Semantic proximity Read ↗

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