The Gene Evolution Model and Computing Its Associated Probabilities

被引:55
作者
Arvestad, Lars [1 ]
Lagergren, Jens [1 ]
Sennblad, Bengt [2 ]
机构
[1] Royal Inst Technol, AlbaNova Univ Ctr, Sch Comp Sci & Commun, SE-10691 Stockholm, Sweden
[2] Stockholm Univ, AlbaNova Univ Ctr, Dept Biochem & Biophys, SE-10691 Stockholm, Sweden
基金
瑞典研究理事会;
关键词
Algorithms; Theory; Phylogeny; gene; evolution; probability; duplication; loss; reconciliation; DNA-SEQUENCES; SIGNED PERMUTATIONS; TREES; PHYLOGENY; INFERENCE; DISTRIBUTIONS; ALGORITHMS; ORTHOLOGS; LINEAGE;
D O I
10.1145/1502793.1502796
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:44
相关论文
共 63 条
  • [1] Addario-Berry Louigi, 2004, J Bioinform Comput Biol, V2, P257, DOI 10.1142/S0219720004000557
  • [2] ARVESTAD L, 2003, BIOINFORMATICS S1, V19, P15
  • [3] Arvestad L., 2004, P 8 ANN INT C RESAER, P326, DOI DOI 10.1145/974614.974657
  • [4] Bayesian gene/species tree reconciliation and orthology analysis using MCMC
    Arvestad, Lars
    Berglund, Ann-Charlotte
    Lagergren, Jens
    Sennblad, Bengt
    [J]. BIOINFORMATICS, 2003, 19 : i7 - i15
  • [5] A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
    Bader, DA
    Moret, BME
    Yan, M
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2001, 8 (05) : 483 - 491
  • [6] A higher-level MRP supertree of placental mammals
    Beck, Robin M. D.
    Bininda-Emonds, Olaf R. P.
    Cardillo, Marcel
    Liu, Fu-Guo Robert
    Purvis, Andy
    [J]. BMC EVOLUTIONARY BIOLOGY, 2006, 6 (1)
  • [8] Bergeron A, 2004, LECT NOTES COMPUT SC, V3109, P388
  • [9] Berman P, 2002, LECT NOTES COMPUT SC, V2461, P200
  • [10] The (Super)tree of life: Procedures, problems, and prospects
    Bininda-Emonds, ORP
    Gittleman, JL
    Steel, MA
    [J]. ANNUAL REVIEW OF ECOLOGY AND SYSTEMATICS, 2002, 33 : 265 - 289