paper-with-me

홈 › Papers

R3F: An R package for evolutionary dates, rates, and priors using the relative rate framework

2025-02-07 · Qiqing Tao, Sudip Sharma, Koichiro Tamura, Sudhir Kumar

The relative rate framework (RRF) can estimate divergence times from branch lengths in a phylogeny, which is the theoretical basis of the RelTime method frequently applied, a relaxed clock approach for molecular dating that scales well for large phylogenies. The use of RRF has also enabled the development of computationally efficient and accurate methods for testing the autocorrelation of lineage rates in a phylogeny (CorrTest) and selecting data-driven parameters of the birth-death speciation model (ddBD), which can be used to specify priors in Bayesian molecular dating. We have developed R3F, an R package implementing RRF to estimate divergence times, infer lineage rates, conduct CorrTest, and build a ddBD tree prior for Bayesian dating in molecular phylogenies. Here, we describe R3F functionality and explain how to interpret and use its outputs in other visualization software and packages, such as MEGA, ggtree, and FigTree. Ultimately, R3F is intended to enable the dating of the Tree of Life with greater accuracy and precision, which would have important implications for studies of organism evolution, diversification dynamics, phylogeography, and biogeography. Availability and Implementation: The source codes and related instructions for installing and implementing R3F are available from GitHub (https://github.com/cathyqqtao/R3F).

📄 PDF Abstract BibTeX arXiv:2502.05004

Code (1)

cathyqqtao/r3f 공식 구현

Similar Papers 제목 키워드 기반

Markov-modulated continuous-time Markov chains to identify site- and branch-specific evolutionary variation

2019-06-12

Markov models of character substitution on phylogenies form the foundation of phylogenetic inference frameworks. Early models made the simplifying assumption that the substitution process is homogeneous over time and acr…

PACEvolve++: Improving Test-time Learning for Evolutionary Search Agents

2026-05-07 · Minghao Yan, Bo Peng, Benjamin Coleman, Ziqi Chen 외 arxiv

Large language models have become drivers of evolutionary search, but most systems rely on a fixed, prompt-elicited policy to sample next candidates. This limits adaptation in practical engineering and research tasks, wh…

Sequential RecommendationReinforcement Learning

The MOEADr Package - A Component-Based Framework for Multiobjective Evolutionary Algorithms Based on Decomposition

2018-07-18 · Felipe Campelo, Lucas S. Batista, Claus Aranha

Multiobjective Evolutionary Algorithms based on Decomposition (MOEA/D) represent a widely used class of population-based metaheuristics for the solution of multicriteria optimization problems. We introduce the MOEADr pac…

Evolutionary Algorithms

LLEMA: Evolutionary Search with LLMs for Multi-Objective Materials Discovery

2025-10-26 · Nikhil Abhyankar, Sanchit Kabra, Saaketh Desai, Chandan K. Reddy arxiv

Materials discovery requires navigating vast chemical and structural spaces while satisfying multiple, often conflicting, objectives. We present LLM-guided Evolution for MAterials discovery (LLEMA), a unified framework t…

Evolutionary System Prompt Learning for Reinforcement Learning in LLMs

2026-02-16 · Lunjun Zhang, Ryan Chen, Bradly C. Stadie arxiv

Building agentic systems that can autonomously self-improve from experience is a longstanding goal of AI. Large language models (LLMs) today primarily self-improve via two mechanisms: self-reflection for context updates,…

Reinforcement Learning