Name
Title | ||
|---|---|---|
Approximating the correction of weighted and unweighted orthology and paralogy relations. |
Abstract | ||
|---|---|---|
We provided complexity and algorithmic results for variants of the problem of correcting a relation graph for satisfiability and consistency. For the maximization variants we were able to design polynomial time approximation schemes, while for the weighted minimization variants we were able to provide the first inapproximability results. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1186/s13015-017-0096-x | Algorithms for Molecular Biology |
Keywords | Field | DocType |
Approximation algorithms,Gene tree,Orthology,Paralogy,Species tree | Approximation algorithm,Converse,Graph,Combinatorics,Satisfiability,Bioinformatics,Always true,Mathematics,Maximization | Journal |
Volume | Issue | ISSN |
12 | 1 | 1748-7188 |
Citations | PageRank | References |
3 | 0.37 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Riccardo Dondi | 1 | 89 | 18.42 |
| Manuel Lafond | 2 | 68 | 12.09 |
| Nadia El-Mabrouk | 3 | 512 | 41.88 |