Article #68117

Delabre, Matteo, El-Mabrouk, Nadia, Huber, Katharina, Lafond, Manuel, Moulton, Vincent, Noutahi, Emmanuel and Sautie Castellanos, Miguel (2018) UNSPECIFIED pp. 179-195.

[img] PDF (Accepted manuscript) - Submitted Version
Restricted to Repository staff only until 08 September 2019.

Download (2690kB) | Request a copy

    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 Duplication-Loss 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.

    Item Type: Article
    Uncontrolled Keywords: gene tree,reconciliation,duplication,loss,synteny
    Faculty \ School: Faculty of Science > School of Computing Sciences
    Depositing User: LivePure Connector
    Date Deposited: 23 Aug 2018 11:32
    Last Modified: 02 Jan 2019 20:30
    URI: https://ueaeprints.uea.ac.uk/id/eprint/68117
    DOI: 10.1007/978-3-030-00834-5_10

    Actions (login required)

    View Item