Minimum tree cost quartet puzzling
From MaRDI portal
Publication:263274
DOI10.1007/S00357-010-9053-9zbMATH Open1337.62131OpenAlexW2095523827MaRDI QIDQ263274FDOQ263274
Authors: Tudor B. Ionescu, Géraldine Polaillon, 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
Recommendations
Cites Work
- 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
- Title not available (Why is that?)
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
Cited In (8)
- Computing phylogenetic trees using topologically related minimum spanning trees
- Improved metaheuristics for the quartet method of hierarchical clustering
- Title not available (Why is that?)
- A new quartet approach for reconstructing phylogenetic trees: Quartet joining method
- An exact algorithm for the minimum quartet tree cost problem
- A fast quartet tree heuristic for hierarchical clustering
- Optimal subtree prune and regraft for quartet score in sub-quadratic time
- Constructing optimal trees from quartets
Uses Software
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)
