A property tester for tree-likeness of quartet topologies
From MaRDI portal
Publication:649111
DOI10.1007/S00224-010-9276-5zbMATH Open1227.68115OpenAlexW2083497080MaRDI QIDQ649111FDOQ649111
Authors: Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith 
Publication date: 30 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9276-5
Recommendations
Cites Work
- Reconstructing the shape of a tree from observed dissimilarity data
- Tree structures for proximity data
- Statistical Inference of Phylogenies
- 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
- Property testing and its connection to learning and approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-testing/correcting with applications to numerical problems
- Robust Characterizations of Polynomials with Applications to Program Testing
- Constructing optimal trees from quartets
- A few logs suffice to build (almost) all trees (I)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- Every monotone graph property is testable
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
- Title not available (Why is that?)
- Analysis of binary trees when occasional multifurcations can be considered as aggregates of bifurcations
Cited In (1)
This page was built for publication: A property tester for tree-likeness of quartet topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649111)
