Incomplete directed perfect phylogeny in linear time

DOI10.1007/978-3-030-83508-8_13OpenAlexW3196336688MaRDI QIDQ832858

Paola Bonizzoni, Giulia Bernardini, Paweł Gawrychowski

Publication date: 25 March 2022

Full work available at URL: https://ir.cwi.nl/pub/31064

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Uses Software

• SPhyR
• SCARLET

Cites Work

• The binary perfect phylogeny with persistent characters
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• 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
• Algorithms in bioinformatics. 10th international workshop, WABI 2010, Liverpool, UK, September 6--8, 2010. Proceedings
• An On-Line Edge-Deletion Problem
• An O(logn) parallel connectivity algorithm
• Sparsification—a technique for speeding up dynamic graph algorithms
• Fully Dynamic Connectivity in O(log n(log log n)²) Amortized Expected Time
• Incomplete Directed Perfect Phylogeny
• Decremental Dynamic Connectivity
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Incomplete directed perfect phylogeny in linear time