A property tester for tree-likeness of quartet topologies
From MaRDI portal
Publication:649111
Recommendations
Cites work
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 1241385 (Why is no real title available?)
- scientific article; zbMATH DE number 1302377 (Why is no real title available?)
- scientific article; zbMATH DE number 1405796 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- A few logs suffice to build (almost) all trees (I)
- A fixed-parameter algorithm for minimum quartet inconsistency
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
- Analysis of binary trees when occasional multifurcations can be considered as aggregates of bifurcations
- Constructing optimal trees from quartets
- Every monotone graph property is testable
- Inferring evolutionary trees with strong combinatorial evidence
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- Property testing and its connection to learning and approximation
- Reconstructing the shape of a tree from observed dissimilarity data
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
- Statistical Inference of Phylogenies
- The complexity of reconstructing trees from qualitative characters and subtrees
- Tree structures for proximity data
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)