Minimum tree cost quartet puzzling

DOI10.1007/S00357-010-9053-9zbMATH Open1337.62131OpenAlexW2095523827MaRDI QIDQ263274FDOQ263274

Géraldine Polaillon, Tudor B. Ionescu, Frédéric Boulanger

Publication date: 4 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-010-9053-9

zbMATH Keywords

distance methodphylogenetic tree reconstructionquartet method

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Title not available (Why is that?)
• Comparison of phylogenetic trees
• Reconstructing the shape of a tree from observed dissimilarity data
• Consensus n-trees
• The complexity of reconstructing trees from qualitative characters and subtrees
• Inferring evolutionary trees with strong combinatorial evidence
• A fixed-parameter algorithm for minimum quartet inconsistency
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• Constructing big trees from short sequences
• A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors

Cited In (1)

• Constructing optimal trees from quartets

Uses Software

• fastDNAml
• PHYLIP
• BIONJ
• Seq-Gen

This page was built for publication: Minimum tree cost quartet puzzling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263274)