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

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

Bioinformatics (Oxford, England) - 1 Jun 2005

Song Yun S, Wu Yufeng, Gusfield Dan

Abstract excerpt

MOTIVATION: We are interested in studying the evolution of DNA single nucleotide polymorphism sequences which have undergone (meiotic) recombination. For a given set of sequences, computing the minimum number of recombinations needed to explain the sequences (with one mutation per site) is a standard question of interest, but it has been shown to be NP-hard, and previous algorithms that compute it exactly work...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Computational Biology
Share to Databases, Protein

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Evolution, Molecular

Share to Recombination, Genetic

Share to Sequence Alignment

Share to Sequence Analysis

Share to Software

Source

Identifiers

PMID: 15961486
DOI: 10.1093/bioinformatics/bti1033

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.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

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

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

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

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

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

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

Inference about recombination from haplotype data: lower bounds and recombination hotspots.Semantic proximity Read ↗

RENT+: an improved method for inferring local genealogical trees from haplotypes with recombination.Semantic proximity Read ↗

Recoverability of ancestral recombination graph topologies.Semantic proximity Read ↗

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

Recovering haplotype structure through recombination and gene conversion.Semantic proximity Read ↗

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

Toward an algebraic understanding of haplotype inference by pure parsimony.Semantic proximity Read ↗

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