Partial homology relations -- satisfiability in terms of di-cographs
From MaRDI portal
Publication:1790998
DOI10.1007/978-3-319-94776-1_34OpenAlexW2799178056MaRDI QIDQ1790998
Marc Hellmuth, Nadia El-Mabrouk, Nikolai Nøjgaard, Daniel Merkle, Nicolas Wieseke
Publication date: 4 October 2018
Full work available at URL: https://arxiv.org/abs/1711.00504
homologyrecognition algorithmpartial relationsorthologyparalogydirected cographsforbidden relationsxenology
Problems related to evolution (92D15) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
The knapsack problem with special neighbor constraints ⋮ Computing directed Steiner path covers ⋮ Cograph editing: Merging modules is equivalent to editing P_4s ⋮ Solutions for subset sum problems with special digraph constraints ⋮ How to compute digraph width measures on directed co-graphs ⋮ Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) ⋮ On characterizations for subclasses of directed co-graphs ⋮ Reconstructing gene trees from Fitch's xenology relation
This page was built for publication: Partial homology relations -- satisfiability in terms of di-cographs
