Abstract | ||
---|---|---|
Classical gene and species tree reconciliation, used to infer the history of gene gain and loss explaining the evolution of gene families, assumes an independent evolution for each family. While this assumption is reasonable for genes that are far apart in the genome, it is clearly not suited for genes grouped in syntenic blocks, which are more plausibly the result of a concerted evolution. Here, we introduce the Super-Reconciliation model, that extends the traditional DuplicationLoss model to the reconciliation of a set of trees, accounting for segmental duplications and losses. From a complexity point of view, we show that the associated decision problem is NP-hard. We then give an exact exponential-time algorithm for this problem, assess its time efficiency on simulated datasets, and give a proof of concept on the opioid receptor genes. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1007/978-3-030-00834-5_10 | COMPARATIVE GENOMICS (RECOMB-CG 2018) |
Keywords | Field | DocType |
Gene tree, Reconciliation, Duplication, Loss, Synteny | Synteny,Genome,Decision problem,Biology,Theoretical computer science,Proof of concept,Genetics,Gene duplication,Gene family,Concerted evolution,Segmental duplication | Conference |
Volume | ISSN | Citations |
11183 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 13 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mattéo Delabre | 1 | 0 | 0.34 |
Nadia El-Mabrouk | 2 | 512 | 41.88 |
Katharina T. Huber | 3 | 139 | 24.31 |
Manuel Lafond | 4 | 68 | 12.09 |
Vincent Moulton | 5 | 39 | 7.46 |
Emmanuel Noutahi | 6 | 2 | 1.04 |
Miguel Sautie Castellanos | 7 | 0 | 0.34 |