Consistency of the QNet algorithm for generating planar split networks from weighted quartets

DOI10.1016/j.dam.2008.06.038zbMath1182.92056OpenAlexW2092699805MaRDI QIDQ1026188

Stefan Grünewald, Vincent L. Moulton, Andreas Spillner

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.038

zbMATH Keywords

phylogenetic treephylogenetic networkquartet treecircular split systemsplit network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Related Items

Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem, Reconstructing a phylogenetic level-1 network from quartets

Uses Software

• BIONJ
• QNet

Cites Work

• The complexity of reconstructing trees from qualitative characters and subtrees
• \(X\)-trees and weighted quartet systems
• Inferring evolutionary trees with strong combinatorial evidence
• Integer linear programming as a tool for constructing trees from quartet data
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Algebraic Statistics for Computational Biology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item