筛选
科学数据
统计数据
共检索到23条 ,权限内显示50条;
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
Data from: The effect of close relatives on unsupervised Bayesian clustering algorithms in population genetic structure analysis
- 负责人：
- DOI：
- doi:10.5061/dryad.668tn571
- 摘要：
- on biology and evolutionary biology. Recently, unsupervised Bayesian clustering algorithms have been developed to detect a hidden population structure from genotypic data, assuming amo
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
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
Data from: Model selection and parameter inference in phylogenetics using nested sampling
- 负责人：
- DOI：
- doi:10.5061/dryad.220d6t5
- 摘要：
- Bayesian inference methods rely on numerical algorithms for both model selection and parameter inference. In general, these algorithms require
Data from: A simple approach for maximizing the overlap of phylogenetic and comparative data
- 负责人：
- DOI：
- doi:10.5061/dryad.5d3rq
- 摘要：
- d, it quickly becomes very challenging to do by hand. Here, we present algorithms that use topological and taxonomic information to maximize the numb
Data from: Mutation rules and the evolution of sparseness and modularity in biological systems
- 负责人：
- DOI：
- doi:10.5061/dryad.75180
- 摘要：
- work suggests that modularity can evolve in a variety of circumstances, including goals that vary in time such that they share the same subgoals (modular
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
Data from: A simulation-based approach to statistical alignment
- 负责人：
- DOI：
- doi:10.5061/dryad.p069231
- 摘要：
- Classic alignment algorithms utilize scoring functions which maximize similarity or minimize edit distances. These scoring functions account for bot
Data from: Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations
- 负责人：
- DOI：
- doi:10.5061/dryad.8f0c8
- 摘要：
- The phylogenetic likelihood function is the major computational bottleneck in several applications of evolutionary biology suc
