Correction of weighted orthology and paralogy relations -- complexity and algorithmic results
From MaRDI portal
Publication:1708421
DOI10.1007/978-3-319-43681-4_10zbMath1383.92054OpenAlexW2491013579MaRDI QIDQ1708421
Riccardo Dondi, Nadia El-Mabrouk, Manuel Lafond
Publication date: 23 March 2018
Full work available at URL: http://hdl.handle.net/10446/78440
Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Signed and weighted graphs (05C22)
Related Items (8)
Complete characterization of incorrect orthology assignments in best match graphs ⋮ Best match graphs ⋮ Cograph editing: Merging modules is equivalent to editing P_4s ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations ⋮ Reconstructing gene trees from Fitch's xenology relation ⋮ Indirect identification of horizontal gene transfer ⋮ Reconciling event-labeled gene trees with MUL-trees and species networks
This page was built for publication: Correction of weighted orthology and paralogy relations -- complexity and algorithmic results
