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

Computing the all-pairs quartet distance on a set of evolutionary trees.

Journal of bioinformatics and computational biology - 1 Feb 2008

Stissing M, Mailund T, Pedersen C N S, Brodal G S, Fagerberg R

Abstract excerpt

We present two algorithms for calculating the quartet distance between all pairs of trees in a set of binary evolutionary trees on a common set of species. The algorithms exploit common substructure among the trees to speed up the pairwise distance calculations, thus performing significantly bett...

Read the complete abstract on PubMed

Topics

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

Share to Chromosome Mapping
Share to Computer Simulation
Share to Evolution, Molecular

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Likelihood Functions

Share to Linkage Disequilibrium

Share to Models, Statistical

Share to Sequence Alignment

Share to Statistical Distributions

Source

Identifiers

PMID: 18324744
DOI: 10.1142/s0219720008003266

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 2 Sept 2026. Prepared record publication-18324744-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

Computing the all-pairs quartet distance on a set of evolutionary trees.PMID 18324744Read ↗

INSTRAL: Discordance-aware Phylogenetic Placement using Quartet ScoresSemantic proximity Read ↗

A stochastic local search algorithm for distance-based phylogeny reconstruction.Semantic proximity Read ↗

TimeTree: A Resource for Timelines, Timetrees, and Divergence Times.Semantic proximity Read ↗

Optimal algorithms for local vertex quartet cleaning.Semantic proximity Read ↗

Beyond pairwise distances: neighbor-joining with phylogenetic diversity estimates.Semantic proximity Read ↗

Estimating evolutionary distances between DNA sequences.Semantic proximity Read ↗

Reconciliation with non-binary species trees.Semantic proximity Read ↗

wQFM: highly accurate genome-scale species tree estimation from weighted quartets.Semantic proximity Read ↗

KegAlign: Optimizing pairwise alignments with diagonal partitioningSemantic proximity Read ↗

Hetero: a program to simulate the evolution of DNA on a four-taxon tree.Semantic proximity Read ↗

Constructing a meaningful evolutionary average at the phylogenetic center of mass.Semantic proximity Read ↗

Reconciliation of gene and species trees.Semantic proximity Read ↗

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