Correction of weighted orthology and paralogy relations -- complexity and algorithmic results
From MaRDI portal
Publication:1708421
DOI10.1007/978-3-319-43681-4_10zbMATH Open1383.92054OpenAlexW2491013579MaRDI QIDQ1708421FDOQ1708421
Authors: Riccardo Dondi, Nadia El-Mabrouk, Manuel Lafond 
Publication date: 23 March 2018
Full work available at URL: http://hdl.handle.net/10446/78440
Recommendations
- Orthology relation and gene tree correction: complexity results
- OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations
- Partial homology relations -- satisfiability in terms of di-cographs
- Beyond representing orthology relations by trees
- Orthology relations, symbolic ultrametrics, and cographs
Applications of graph theory (05C90) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Signed and weighted graphs (05C22)
Cited In (11)
- Cograph editing: Merging modules is equivalent to editing P_4s
- The matroid structure of representative triple sets and triple-closure computation
- Reconstructing gene trees from Fitch's xenology relation
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- Best match graphs
- Complete characterization of incorrect orthology assignments in best match graphs
- Indirect identification of horizontal gene transfer
- Partial homology relations -- satisfiability in terms of di-cographs
- OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations
- Reconciling event-labeled gene trees with MUL-trees and species networks
- Orthology relation and gene tree correction: complexity results
This page was built for publication: Correction of weighted orthology and paralogy relations -- complexity and algorithmic results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708421)
