Ademir Hujdurović (Author), Edin Husić (Author), Martin Milanič (Author), Romeo Rizzi (Author), Alexandru I. Tomescu (Author)

Abstract

Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem

Keywords

perfect phylogeny;minimum conflict-free row split problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;APXhardness;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UP - University of Primorska
UDC: 519.17
COBISS: 1540282052 Link will open in a new window
ISSN: 1549-6325
Views: 2210
Downloads: 154
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Pages: Article 20 (26 str.)
Volume: ǂVol. ǂ14
Issue: ǂno. ǂ2
Chronology: 2018
DOI: 10.1145/3182178
ID: 10930888