Incomplete directed perfect phylogeny in linear time
From MaRDI portal
Publication:832858
Recommendations
- scientific article; zbMATH DE number 1615277
- Incomplete Directed Perfect Phylogeny
- A linear-time algorithm for the perfect phylogeny haplotype problem
- scientific article; zbMATH DE number 2102787
- A Polynomial-Time Algorithm for Near-Perfect Phylogeny
- Research in Computational Molecular Biology
- Polynomial-time algorithms for phylogenetic inference problems
- On the Generality of Phylogenies from Incomplete Directed Characters
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
Cites work
- Algorithms in bioinformatics. 10th international workshop, WABI 2010, Liverpool, UK, September 6--8, 2010. Proceedings
- An O(logn) parallel connectivity algorithm
- An On-Line Edge-Deletion Problem
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- Decremental Dynamic Connectivity
- Efficient algorithms for inferring evolutionary trees
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time
- Incomplete Directed Perfect Phylogeny
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Sparsification—a technique for speeding up dynamic graph algorithms
- The binary perfect phylogeny with persistent characters
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
Cited in
(2)
This page was built for publication: Incomplete directed perfect phylogeny in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832858)
