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

Properties of normal phylogenetic networks.

Bulletin of mathematical biology - 1 Feb 2010

Willson Stephen J

Abstract excerpt

A phylogenetic network is a rooted acyclic digraph with vertices corresponding to taxa. Let X denote a set of vertices containing the root, the leaves, and all vertices of outdegree 1. Regard X as the set of vertices on which measurements such as DNA can be made. A vertex is called normal if it h...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Evolution, Molecular
Share to Genetic Speciation

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Genome

Share to Models, Genetic

Share to Mutation

Share to Phylogeny

Share to Recombination, Genetic

Source

Identifiers

PMID: 19789927
DOI: 10.1007/s11538-009-9449-z

Provenance

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

Properties of normal phylogenetic networks.PMID 19789927Read ↗

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

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

Reconstructing reticulate evolution in species-theory and practice.Semantic proximity Read ↗

Constructing near-perfect phylogenies with multiple homoplasy events.Semantic proximity Read ↗

Fixed-parameter algorithms in phylogenetics.Semantic proximity Read ↗

Phylogenetic invariants for the general Markov model of sequence mutation.Semantic proximity Read ↗

Distorted metrics on trees and phylogenetic forests.Semantic proximity Read ↗

Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.Semantic proximity Read ↗

Reconstructing recombination network from sequence data: the small parsimony problem.Semantic proximity Read ↗

A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem.Semantic proximity Read ↗

Trees and/or networks to display intraspecific DNA sequence variation?Semantic proximity Read ↗

Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution.Semantic proximity Read ↗

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