Change search
ReferencesLink to record
Permanent link

Direct link
The Gene Evolution Model and Computing Its Associated Probabilities
KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
KTH, School of Computer Science and Communication (CSC), Computational Biology, CB.
2009 (English)In: Journal of the ACM, ISSN 0004-5411, E-ISSN 1557-735X, Vol. 56, no 2Article in journal (Refereed) Published
Abstract [en]

Phylogeny is both a fundamental tool in biology and a rich source of fascinating modeling and algorithmic problems. Today's wealth of sequenced genomes makes it increasingly important to understand evolutionary events such as duplications, losses, transpositions, inversions, lateral transfers, and domain shuffling. We focus on the gene duplication event, that constitutes a major force in the creation of genes with new function [Ohno 1970; Lynch and Force 2000] and, thereby also, of biodiversity. We introduce the probabilistic gene evolution model, which describes how a gene tree evolves within a given species tree with respect to speciation, gene duplication, and gene loss. The actual relation between gene tree and species tree is captured by a reconciliation, a concept which we generalize for more expressiveness. The model is a canonical generalization of the classical linear birth-death process, obtained by replacing the interval where the process takes place by a tree. For the gene evolution model, we derive efficient algorithms for some associated probability distributions: the probability of a reconciled tree, the probability of a gene tree, the maximum probability reconciliation, the posterior probability of a reconciliation, and sampling reconciliations with respect to the posterior probability. These algorithms provides the basis for several applications, including species tree construction, reconciliation analysis, orthology analysis, biogeography, and host-parasite co-evolution.

Place, publisher, year, edition, pages
2009. Vol. 56, no 2
Keyword [en]
Algorithms, Theory, Phylogeny, gene, evolution, probability, duplication, loss, reconciliation, dna-sequences, molecular phylogenies, signed permutations, maximum-likelihood, tree distributions, species trees, inference, incongruence, algorithms, orthologs
URN: urn:nbn:se:kth:diva-18396DOI: 10.1145/1502793.1502796ISI: 000265836200003ScopusID: 2-s2.0-70349414048OAI: diva2:336443
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2010-12-13Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Arvestad, LarsLagergren, Jens
By organisation
Computational Biology, CB
In the same journal
Journal of the ACM

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 69 hits
ReferencesLink to record
Permanent link

Direct link