Fast error-tolerant quartet phylogeny algorithms

DOI10.1016/J.TCS.2012.02.016zbMATH Open1292.68154OpenAlexW2964231993MaRDI QIDQ390892FDOQ390892

Authors: Daniel G. Brown, Jakub Truszkowski 

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.016

Recommendations

• Fast error-tolerant quartet phylogeny algorithms
• Constructing optimal trees from quartets
• scientific article; zbMATH DE number 1305402
• Publication:4938781
• scientific article; zbMATH DE number 6297767

zbMATH Keywords

quartet-based phylogeny algorithm

Mathematics Subject Classification ID

Problems related to evolution (92D15) Randomized algorithms (68W20) Searching and sorting (68P10)

Cites Work

• Computing with Noisy Information
• Title not available (Why is that?)
• A note on the height of binary search trees
• Title not available (Why is that?)
• Concentration of Measure for the Analysis of Randomized Algorithms
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• Title not available (Why is that?)
• Determining the Evolutionary Tree Using Experiments
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Phylogenies without branch bounds: contracting the short, pruning the deep
• A few logs suffice to build (almost) all trees. II
• Noisy binary search and its applications
• Fast error-tolerant quartet phylogeny algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Fast error-tolerant quartet phylogeny algorithms
• Title not available (Why is that?)
• Rapidly computing the phylogenetic transfer index
• Maximal Accurate Forests from Distance Matrices
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining

Uses Software

• FastTree

This page was built for publication: Fast error-tolerant quartet phylogeny algorithms

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