筛选
科学数据
统计数据
共检索到48条 ,权限内显示50条;
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: A general and efficient algorithm for the likelihood of diversification and discrete-trait evolutionary models
- 负责人:
- DOI:
- doi:10.5061/dryad.6vm72sm
- 摘要:
- rise to them, macroevolutionary analyses are becoming increasingly limited by computational requirements. Here we introduce a novel algorithm, based
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: Improving HybrID: how to best combine indirect and direct encoding in evolutionary algorithms
- 负责人:
- DOI:
- doi:10.5061/dryad.7c4g3
- 摘要:
- ts. Evolutionary algorithms with indirect encoding perform better on regular problems because they reuse genomic information to create regular phenotypes. However, on problems
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: Inference of evolutionary jumps in large phylogenies using Lévy processes
- 负责人:
- DOI:
- doi:10.5061/dryad.170rb
- 摘要:
- directly, yet inferring evolutionary jumps remains computationally very challenging. Here, we develop a computationally highly efficient algorithm
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: A nonstationary Markov model detects directional evolution in hymenopteran morphology
- 负责人:
- DOI:
- doi:10.5061/dryad.0sn23
- 摘要:
- , we develop a Bayesian approach for testing directional versus stationary evolution using a reversible-jump algorithm. Simulations show that when only data from
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: Evolutionary online behaviour learning and adaptation in real robots
- 负责人:
- DOI:
- doi:10.5061/dryad.s8t8p
- 摘要:
- on the performance of the underlying evolutionary algorithm.
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: A simple approach for maximizing the overlap of phylogenetic and comparative data
- 负责人:
- DOI:
- doi:10.5061/dryad.5d3rq
- 摘要:
- our algorithm to empirical data sets. It is relatively efficient such that taxon swaps can be quickly computed, even for large trees. To facilitate the us
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Algorithm for Isolating Congruent Phylogenomic Datasets"" data-category="" data-cropid="" data-dimen="" data-id="E6637ADB-B053-4E9E-B1CE-C684E3A1D16E"> Supporting data for "Clusterflock: A Flocking Algorithm for Isolating Congruent Phylogenomic Datasets"
- 负责人:
- 关键词:
- Software
- DOI:
- doi:10.5524/100247
- 摘要:
- Collective animal behavior such as the flocking of birds or the shoaling of fish has inspired a class of algorithms designed to optimize distance
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: EPA-ng: massively parallel evolutionary placement of genetic sequences
- 负责人:
- DOI:
- doi:10.5061/dryad.kb505nc
- 摘要:
- how these sequences fit into anevolutionary context. Previous implementations of phylogenetic placement algorithms, such as the Evolutionary
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: Model selection and parameter inference in phylogenetics using nested sampling
- 负责人:
- DOI:
- doi:10.5061/dryad.220d6t5
- 摘要:
- likelihood. This quantity is commonly used for comparing different evolutionary models, but its calculation, even for simple models, incurs high computational cost. Another
![](http://agri.nais.net.cn/resources/front/images/source_91.jpg)
Data from: Effective online Bayesian phylogenetics via sequential Monte Carlo with guided proposals
- 负责人:
- DOI:
- doi:10.5061/dryad.n7n85
- 摘要:
- ful for dynamically unfolding evolutionary stories. This limitation can be addressed by applying a class of Bayesian statistical inference algorithms cal