Probability Steiner trees and maximum parsimony in phylogenetic analysis

DOI10.1007/s00285-011-0442-4zbMath1279.92061OpenAlexW2048984001WikidataQ44404387 ScholiaQ44404387MaRDI QIDQ393567

Jia Feng Weng, Mareels, Iven M. Y., Doreen Anne Thomas

Publication date: 23 January 2014

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-011-0442-4

zbMATH Keywords

Steiner treephylogenetic treemaximum parsimony

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Combinatorial probability (60C05)

Related Items

Euclidean Steiner trees optimal with respect to swapping 4-point subtrees

Uses Software

• CVX
• PHYLIP

Cites Work

• Global optimization. From theory to implementation.
• The Steiner problem in phylogeny is NP-complete
• Statistical methods in bioinformatics. An introduction.
• Dynamic programming for minimum Steiner trees
• Faster Steiner Tree Computation in Polynomial-Space
• Computing steiner minimum trees in Hamming metric
• Minimal Mutation Trees of Sequences
• COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ₁ AND ℓ₂ METRIC SPACES
• A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees