系统发育分析中的最大简约法及其优化

随着生物技术的不断发展和系统发育学的深入研究, 在重构系统发育树时, 研究人员往往要面对更多的挑战和困难, 比如： (1)需要分析的样本数（物种数或个体数）不断增加; (2)需要分析的数据量迅速扩大。尤其在基因组测序技术的推动下, 基于分子信息的系统发育重建需要极大的计算量, 因此数学方法、 计算机技术以及其他辅助工具对于系统发育重建的效率和精确度起着至关重要的作用。最大简约法（maximum parsimony）是一种重要的系统发育重建方法, 提高其计算效率对系统发育学研究具有重要意义, 针对该算法的优化改进需要生物学家和计算机专家的共同努力。本文通过详细地阐述最大简约法的计算流程, 分析其参数选择对计算效率的影响, 帮助更多的计算机使用者, 在并不了解系统发育学基础的情况下, 更方便地针对实际的系统发育算法问题给出更好、 更快、 更精准的解决方案; 同时为系统发育研究工作者, 较为清晰地解释最大简约法的构树思想和计算逻辑, 推动针对最大简约法的不断改进与优化。     

哺乳动物系统发育基因组学研究进展

哺乳动物是一类最进化并在地球上占主导地位的动物类群,重建其系统发育关系一直是分子系统学的研究热点。随着越来越多物种全基因组测序的完成,在基因组水平上探讨该类动物的系统发育关系与进化成为研究的热点。本文从全基因组序列,稀有基因组变异及染色体涂染等几个方面简要介绍了当前系统发育基因组学在现生哺乳动物分子系统学中的应用,综合已有的研究归纳整理了胎盘亚纲的总目及目间的系统发育关系,给出了胎盘动物19 个目的系统发育树。本文还分析了哺乳动物系统发育基因组学目前所面临的主要问题及未来的发展前景。     

整合系统发育信息: 概念、方法与挑战

DNA序列、形态和其他同源性状可以用于推断物种的起源和历史。整合所有可利用的系统发育信息可以大大拓展所覆盖类群的范围, 推进我们对现存生物的认识, 而且使得生物学家提出和验证的假说尺度更广, 更有统计说服力。文章综述了整合系统发育信息的概念及其与传统分析的异同, 重点讨论了整合系统发育信息中应用最广的超级树(Supertree)和超级矩阵(Supermatrix)方法; 在比较分析了这两个方法的优缺点之后, 介绍了近些年提出的新的方法。文章详细分析了整合系统发育信息的发展所面临的来自数据和理论方面的挑战, 认为尽管整合分析的发展困难较多, 它仍然是到目前为止构建完整生命之树(网)的唯一方法; 它的完善必将拓展我们对于生物进化过程的认识, 并对进化生物学相关学科产生积极影响。     

系统发育基因组学研究进展

系统发育基因组学是利用全基因组数据构建系统发育树的新领域。全基因组数据能有效消除横向基因转移和类群间基因进化速率差异等因素对系统发育树的影响。根据所使用的全基因组数据的类型, 可以将系统发育基因组学方法分为以下5类：多基因联合建树方法, 基于基因含量的方法, 基于基因排列信息的方法, 基于序列短串含量特征信息的方法及基于代谢途径的方法。文章系统地总结了每一类方法的原理、速度、准确性、适用范围及在各个生物类群中的应用, 并对系统发育基因组学的前景及面临的挑战进行了概述。     

应用SuperTRI方法重建百合目的系统发育关系

SuperTRI是Ropiquet等(2009)发表的一种新的超树方法,可以通过合并所有系统发育信息来共同组建大的系统发育树.该方法克服了超矩阵法和传统超树法的一些限制,使提出的系统发育假说可信度更高,更具有统计说服力.本文应用SupperTRI方法重建了百合目(Liliales)主要类群的系统发育关系,并与超矩阵法的分析结果进行了比较.结果显示:(1) SuperTRI方法产生了与超矩阵法相似的拓扑结构,但节点支持率相对较低,其中再现性指数对评判分支的可信性更容易理解,在系统树图示方法上也更直观;(2)SuperTRI系统树证实百合科、菝葜科、垂花科和菝葜藤科为一单系分支;黑药花科为一独立分支;秋水仙科、六出花科、刺藤科为一单系分支,但这3个大分支间的关系未明;支持白玉簪科和金梅草科互为姐妹群,是百合目最基部类群.     

系统发育多样性测定及其在生物多样性保护中的应用

生物多样性保护面临两个基本问题：如何确定生物多样性测度以及如何保护生物多样性。传统的生物多样性测度是以物种概念为基础的,用生态学和地理学方法确定各种生物多样性指数。其测度依赖于样方面积的大小,并且所有的物种在分类上同等对待。系统发育多样性测度基于系统发育和遗传学的理论和方法,能确定某一物种对类群多样性的贡献大小。该方法比较复杂,只有在类群的系统发育或遗传资料比较齐全时方能应用。本文认为,物种生存力     

分子生物学技术在双翅目实蝇科昆虫系统发育研究中的应用

分子生物学技术如同工酶电泳、RFLP、RAPD、核酸序列分析、微卫星DNA和探针杂交等,在实蝇科昆虫系统发育研究中具有重要作用。利用这些技术对实蝇种群进行系统发育研究,揭示其亲缘及进化关系,从生命本质上寻找实蝇种群间的内在联系。文章综述上述几种分子生物学技术在实蝇科昆虫核酸结构、种内和种间的亲缘及进化关系等方面的研究进展,分析在应用中存在的问题,展望这些分子生物学技术在实蝇科昆虫系统发育中的应用前景。     

被子植物系统发育深层关系研究: 进展与挑战

被子植物系统发育学是研究被子植物及其各类群间亲缘关系与进化历史的学科。从20世纪90年代起, 核苷酸和氨基酸序列等分子数据开始被广泛运用于被子植物系统发育研究, 经过20多年的发展, 从使用单个或联合少数几个细胞器基因, 到近期应用整个叶绿体基因组来重建被子植物的系统发育关系, 目、科水平上的被子植物系统发育框架已被广泛接受。在这个框架中, 基部类群、主要的5个分支(即真双子叶植物、单子叶植物、木兰类、金粟兰目和金鱼藻目)、每个分支所包含的目以及几个大分支包括的核心类群等都具有高度支持。与此同时, 细胞器基因还存在一些固有的问题, 例如单亲遗传、系统发育信息量有限等, 因此近年来双亲遗传的核基因在被子植物系统发育研究中的重要性逐渐得到关注, 并在不同分类阶元的研究中都取得了一定进展。但是, 被子植物系统发育中仍然存在一些难以确定的关系, 例如被子植物5个分支之间的关系、真双子叶植物内部某些类群的位置等。本文简述了20多年来被子植物系统发育深层关系的主要研究进展, 讨论了被子植物系统发育学常用的细胞器基因和核基因的选用, 已经确定和尚未确定系统发育位置的主要类群, 以及研究中尚存在的问题和可能的解决方法。     

质体系统发育基因组解析旋花科系统发育关系

旋花科是一个世界广布的类群,具有丰富的形态特征和重要的经济价值。然而,目前该科主要分支或族间的系统发育关系问题一直未解决。为解析旋花科内系统发育关系,该研究代表性选取旋花科内8个族40个物种,基于质体全基因组数据,使用最大似然法和贝叶斯推论进行系统发育分析。结果表明：(1)旋花科质体基因组均为四分体结构,质体基因组大小为113 273～164 112 bp,蛋白质编码基因数目为66～79个。(2)基于五种DNA矩阵(即WCG、CDS、LSC、IR、SSC)的系统发育分析结果显示,WCG矩阵和CDS矩阵的拓扑结构基本一致,仅少数分支的支持率略有差异;LSC矩阵和WCG矩阵的拓扑结构差异在于菟丝子族、马蹄金族和盐帚花族的系统位置;AU检验和SH检验结果显示,WCG矩阵和SSC矩阵与IR矩阵的拓扑结构有显著冲突。(3)所有系统发育分析结果均显示,菟丝子属和马蹄金族都包括在旋花亚科内,应处理为族等级。(4)基于WCG矩阵和CDS矩阵较好地解决了旋花科8个族之间的系统发育关系,即心被藤族和丁公藤族聚为一支,最先从旋花亚科分化出来,随后是菟丝子族,剩下的5个族分成2个分支。(5)系统发育基因组分析...     

利用植物DNA条形码构建亚热带森林群落系统发育关系——以鼎湖山样地为例

在群落水平上重建植物系统发育关系是当前植物系统学研究的一项重要内容;DNA条形码技术的出现为这一工作的开展提供了便利。本文选取国际通用的植物DNA条形码（rbcL,matK和psbA trnH）,对鼎湖山大样地的183个物种（隶属于24目51科110属）进行测序;分别利用两位点和三位点DNA条形码组合构建该样地植物群落的系统发育关系,并比较不同位点组合构建出的群落系统发育关系的拓扑结构和节点支持率;最后选出一个具有最好拓扑结构和最高节点支持率的鼎湖山大样地群落系统发育关系。在目、科和属这三个水平上,三位点条形码片段组合构建的群落系统发育关系与APG系统获得较好匹配;有些进化分支在相应的APG系统位置解决得不好,却在条形码序列构建的系统发育关系中得到了较好解决。表明综合使用不同进化速率的DNA条形码片段并采取三位点超级矩阵的组合策略,在未采用APG系统大框架的情况下,也能快速而又相对准确地构建出鼎湖山南亚热带森林植物群落的系统发育关系。     

拓扑树间的通经拓扑距离

给出了一种新的系统树间的拓扑距离,使用NJ,MP,UPGMA等3种方法对13种动物的线粒体中14个基因（含组合的）DNA序列数据进行系统树的构建,利用分割拓扑距离和本文给出的通经拓扑距离对这14种系统树这间及其与真树进行比较。结果显示,NJ法对获得已知树的有效率最高,MP法次之,UPGMA法最低。这14种DNA序列所构建的系统树与已知树的拓扑距离基本上是随其DNA序列长度增加而减小,但两者的相关系数并未达到显著水平,分割拓扑距离在总体上可反映树间的拓扑结构差异,但其测度精确度比通经拓扑距离要低。     

DPRml: distributed phylogeny reconstruction by maximum likelihood

MOTIVATION: In recent years there has been increased interest in producing large and accurate phylogenetic trees using statistical approaches. However for a large number of taxa, it is not feasible to construct large and accurate trees using only a single processor. A number of specialized parallel programs have been produced in an attempt to address the huge computational requirements of maximum likelihood. We express a number of concerns about the current set of parallel phylogenetic programs which are currently severely limiting the widespread availability and use of parallel computing in maximum likelihood-based phylogenetic analysis. RESULTS: We have identified the suitability of phylogenetic analysis to large-scale heterogeneous distributed computing. We have completed a distributed and fully cross-platform phylogenetic tree building program called distributed phylogeny reconstruction by maximum likelihood. It uses an already proven maximum likelihood-based tree building algorithm and a popular phylogenetic analysis library for all its likelihood calculations. It offers one of the most extensive sets of DNA substitution models currently available. We are the first, to our knowledge, to report the completion of a distributed phylogenetic tree building program that can achieve near-linear speedup while only using the idle clock cycles of machines. For those in an academic or corporate environment with hundreds of idle desktop machines, we have shown how distributed computing can deliver a 'free' ML supercomputer.     

Relaxed Neighbor Joining: A Fast Distance-Based Phylogenetic Tree Construction Method

Our ability to construct very large phylogenetic trees is becoming more important as vast amounts of sequence data are becoming readily available. Neighbor joining (NJ) is a widely used distance-based phylogenetic tree construction method that has historically been considered fast, but it is prohibitively slow for building trees from increasingly large datasets. We developed a fast variant of NJ called relaxed neighbor joining (RNJ) and performed experiments to measure the speed improvement over NJ. Since repeated runs of the RNJ algorithm generate a superset of the trees that repeated NJ runs generate, we also assessed tree quality. RNJ is dramatically faster than NJ, and the quality of resulting trees is very similar for the two algorithms. The results indicate that RNJ is a reasonable alternative to NJ and that it is especially well suited for uses that involve large numbers of taxa or highly repetitive procedures such as bootstrapping. [Reviewing Editor: Dr. James Bull]     

Analysis and visualization of tree space

We explored the use of multidimensional scaling (MDS) of tree-to-tree pairwise distances to visualize the relationships among sets of phylogenetic trees. We found the technique to be useful for exploring "tree islands" (sets of topologically related trees among larger sets of near-optimal trees), for comparing sets of trees obtained from bootstrapping and Bayesian sampling, for comparing trees obtained from the analysis of several different genes, and for comparing multiple Bayesian analyses. The technique was also useful as a teaching aid for illustrating the progress of a Bayesian analysis and as an exploratory tool for examining large sets of phylogenetic trees. We also identified some limitations to the method, including distortions of the multidimensional tree space into two dimensions through the MDS technique, and the definition of the MDS-defined space based on a limited sample of trees. Nonetheless, the technique is a useful approach for the analysis of large sets of phylogenetic trees.     

New Weighting Methods for Phylogenetic Tree Reconstruction Using Multiple Loci

Efficient determination of evolutionary distances is important for the correct reconstruction of phylogenetic trees. The performance of the pooled distance required for reconstructing a phylogenetic tree can be improved by applying large weights to appropriate distances for reconstructing phylogenetic trees and small weights to inappropriate distances. We developed two weighting methods, the modified Tajima–Takezaki method and the modified least-squares method, for reconstructing phylogenetic trees from multiple loci. By computer simulations, we found that both of the new methods were more efficient in reconstructing correct topologies than the no-weight method. Hence, we reconstructed hominoid phylogenetic trees from mitochondrial DNA using our new methods, and found that the levels of bootstrap support were significantly increased by the modified Tajima–Takezaki and by the modified least-squares method.     

The phylogeny of Schistidium (Bryophyta, Grimmiaceae) based on primary and secondary structure study of nuclear rDNA internal transcribed spacers

The phylogeny of Schistidium (Bryophyta, Grimmiaceae) was studied on the basis of nucleotide sequences of internal transcribed spacers ITS1-2 of nuclear DNA and trnT-trnD region of chloroplast DNA. The consistency of phylogenetic trees constructed from nuclear and chloroplast sequences was shown. A basal grade and two large clades were resolved on the phylogenetic trees. Morphological characteristics specific for these clades were described. ITS1 and ITS2 secondary structures of Schistidium species were modeled using thermodynamic criteria. Four different structures of the longest ITS1 hairpin were identified. Possible paths of Schistidium evolution were considered based on the four types of ITS1 secondary structure and phylogenetic trees.     

Assessing the performance of single-copy genes for recovering robust phylogenies

Phylogenies involving nonmodel species are based on a few genes, mostly chosen following historical or practical criteria. Because gene trees are sometimes incongruent with species trees, the resulting phylogenies may not accurately reflect the evolutionary relationships among species. The increase in availability of genome sequences now provides large numbers of genes that could be used for building phylogenies. However, for practical reasons only a few genes can be sequenced for a wide range of species. Here we asked whether we can identify a few genes, among the single-copy genes common to most fungal genomes, that are sufficient for recovering accurate and well-supported phylogenies. Fungi represent a model group for phylogenomics because many complete fungal genomes are available. An automated procedure was developed to extract single-copy orthologous genes from complete fungal genomes using a Markov Clustering Algorithm (Tribe-MCL). Using 21 complete, publicly available fungal genomes with reliable protein predictions, 246 single-copy orthologous gene clusters were identified. We inferred the maximum likelihood trees using the individual orthologous sequences and constructed a reference tree from concatenated protein alignments. The topologies of the individual gene trees were compared to that of the reference tree using three different methods. The performance of individual genes in recovering the reference tree was highly variable. Gene size and the number of variable sites were highly correlated and significantly affected the performance of the genes, but the average substitution rate did not. Two genes recovered exactly the same topology as the reference tree, and when concatenated provided high bootstrap values. The genes typically used for fungal phylogenies did not perform well, which suggests that current fungal phylogenies based on these genes may not accurately reflect the evolutionary relationships among species. Analyses on subsets of species showed that the phylogenetic performance did not seem to depend strongly on the sample. We expect that the best-performing genes identified here will be very useful for phylogenetic studies of fungi, at least at a large taxonomic scale. Furthermore, we compare the method developed here for finding genes for building robust phylogenies with previous ones and we advocate that our method could be applied to other groups of organisms when more complete genomes are available.     

Random sampling of constrained phylogenies: conducting phylogenetic analyses when the phylogeny is partially known

Statistical randomization tests in evolutionary biology often require a set of random, computer-generated trees. For example, earlier studies have shown how large numbers of computer-generated trees can be used to conduct phylogenetic comparative analyses even when the phylogeny is uncertain or unknown. These methods were limited, however, in that (in the absence of molecular sequence or other data) they allowed users to assume that no phylogenetic information was available or that all possible trees were known. Intermediate situations where only a taxonomy or other limited phylogenetic information (e.g., polytomies) are available are technically more difficult. The current study describes a procedure for generating random samples of phylogenies while incorporating limited phylogenetic information (e.g., four taxa belong together in a subclade). The procedure can be used to conduct comparative analyses when the phylogeny is only partially resolved or can be used in other randomization tests in which large numbers of possible phylogenies are needed.     

Constructing phylogenetic trees using interacting pathways

Phylogenetic trees are used to represent evolutionary relationships among biological species or organisms. The construction of phylogenetic trees is based on the similarities or differences of their physical or genetic features. Traditional approaches of constructing phylogenetic trees mainly focus on physical features. The recent advancement of high-throughput technologies has led to accumulation of huge amounts of biological data, which in turn changed the way of biological studies in various aspects. In this paper, we report our approach of building phylogenetic trees using the information of interacting pathways. We have applied hierarchical clustering on two domains of organisms—eukaryotes and prokaryotes. Our preliminary results have shown the effectiveness of using the interacting pathways in revealing evolutionary relationships.     

Phylogeny for the faint of heart: a tutorial

Phylogenetic trees seem to be finding ever broader applications, and researchers from very different backgrounds are becoming interested in what they might have to say. This tutorial aims to introduce the basics of building and interpreting phylogenetic trees. It is intended for those wanting to understand better what they are looking at when they look at someone else's trees or to begin learning how to build their own. Topics covered include: how to read a tree, assembling a dataset, multiple sequence alignment (how it works and when it does not), phylogenetic methods, bootstrap analysis and long-branch artefacts, and software and resources.