Hujdurović, Ademir; Husić, Edin; Milanić, Martin; Rizzi, Romeo; Tomescu, Alexandru I. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth’s theorem. (English) Zbl 1454.92023 ACM Trans. Algorithms 14, No. 2, Article No. 20, 26 p. (2018). Cited in 1 ReviewCited in 3 Documents MSC: 92D15 Problems related to evolution 05C20 Directed graphs (digraphs), tournaments 05C90 Applications of graph theory 68W25 Approximation algorithms 92D10 Genetics and epigenetics Keywords:APX-hardness; Dilworth’s theorem; perfect phylogeny; acyclic digraph; approximation algorithm; branching; chain partition; min-max theorem; minimum conflict-free row split problem Citations:Zbl 1367.92082; Zbl 1367.92083 PDFBibTeX XMLCite \textit{A. Hujdurović} et al., ACM Trans. Algorithms 14, No. 2, Article No. 20, 26 p. (2018; Zbl 1454.92023) Full Text: DOI arXiv Link