Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
The Gene Evolution Model and Computing Its Associated Probabilities
KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsbiologi, CB.
KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsbiologi, CB.
2009 (Engelska)Ingår i: Journal of the ACM, ISSN 0004-5411, E-ISSN 1557-735X, Vol. 56, nr 2Artikel i tidskrift (Refereegranskat) 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.

Ort, förlag, år, upplaga, sidor
2009. Vol. 56, nr 2
Nyckelord [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
Identifikatorer
URN: urn:nbn:se:kth:diva-18396DOI: 10.1145/1502793.1502796ISI: 000265836200003Scopus ID: 2-s2.0-70349414048OAI: oai:DiVA.org:kth-18396DiVA, id: diva2:336443
Anmärkning
QC 20100525Tillgänglig från: 2010-08-05 Skapad: 2010-08-05 Senast uppdaterad: 2017-12-12Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Sök vidare i DiVA

Av författaren/redaktören
Arvestad, LarsLagergren, Jens
Av organisationen
Beräkningsbiologi, CB
I samma tidskrift
Journal of the ACM

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 296 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf