Evolutionary Sparse Learning for Phylogenomics.
10
TL;DR: ESL as mentioned in this paper is a supervised machine learning approach with sparsity constraints for phylogenomics, referred to as evolutionary sparse learning (ESL). ESL builds models with genomic loci (e.g., genes, proteins, genomic segments, and positions) as parameters.
read more
Abstract: We introduce a supervised machine learning approach with sparsity constraints for phylogenomics, referred to as evolutionary sparse learning (ESL). ESL builds models with genomic loci—such as genes, proteins, genomic segments, and positions—as parameters. Using the Least Absolute Shrinkage and Selection Operator, ESL selects only the most important genomic loci to explain a given phylogenetic hypothesis or presence/absence of a trait. ESL models do not directly involve conventional parameters such as rates of substitutions between nucleotides, rate variation among positions, and phylogeny branch lengths. Instead, ESL directly employs the concordance of variation across sequences in an alignment with the evolutionary hypothesis of interest. ESL provides a natural way to combine different molecular and nonmolecular data types and incorporate biological and functional annotations of genomic loci in model building. We propose positional, gene, function, and hypothesis sparsity scores, illustrate their use through an example, and suggest several applications of ESL. The ESL framework has the potential to drive the development of a new class of computational methods that will complement traditional approaches in evolutionary genomics, particularly for identifying influential loci and sequences given a phylogeny and building models to test hypotheses. ESL’s fast computational times and small memory footprint will also help democratize big data analytics and improve scientific rigor in phylogenomics.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Current progress and open challenges for applying deep learning across the biosciences
Nicolae Sapoval,Amirali Aghazadeh,Michael Nute,Dinler A. Antunes,Advait Balaji,Richard G. Baraniuk,C. J. Barberan,Ruth Dannenfelser,Chen Dun,Mohammadamin Edrisi,R. A. Leo Elworth,Bryce Kille,Anastasios Kyrillidis,Luay Nakhleh,Cameron R. Wolfe,Zhi Yan,Vicky Yao,Todd J. Treangen +17 more
TL;DR: Deep learning has recently enabled unprecedented advances in one of the grand challenges in computational biology: the half-century-old problem of protein structure prediction as discussed by the authors , which has been discussed in detail in this paper.
OUP accepted manuscript
01 Mar 2022
TL;DR: In this article , the authors proposed a method to shrink the carbon footprint of molecular evolutionary analyses by aligning multiple sequences, optimizing substitution models, inferring evolutionary trees, testing phylogenies by bootstrap analysis and estimating divergence times.
21
Constructing phylogenetic networks via cherry picking and machine learning
Giulia Bernardini,Leo van Iersel,Esther Julien,Leen Stougie +3 more
TL;DR: Constructing phylogenetic networks via cherry picking and machine learning produces efficient heuristics applicable to large datasets, leveraging machine learning techniques to capture essential information on the structure of input trees.
OUP accepted manuscript
24 Jun 2022
TL;DR: In this article , an artificial-intelligence-based approach is proposed to select the optimal subset of sites and a formula by which one can compute the log-likelihood of the entire data based on this subset.
A LASSO-based approach to sample sites for phylogenetic tree search
Noa Ecker,Dana Azouri,Ben Bettisworth,Alexandros Stamatakis,Yishay Mansour,Itay Mayrose,Tal Pupko +6 more
TL;DR: An artificial-intelligence-based approach, which provides means to select the optimal subset of sites and a formula by which one can compute the log-likelihood of the entire data based on this subset, based on training a regularized Lasso-regression model.
References
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
An introduction to ROC analysis
TL;DR: The purpose of this article is to serve as an introduction to ROC graphs and as a guide for using them in research.
21.3K
Regularization and variable selection via the elastic net
Hui Zou,Trevor Hastie +1 more
TL;DR: It is shown that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation, and an algorithm called LARS‐EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lamba.
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Jianqing Fan,Runze Li +1 more
TL;DR: In this article, penalized likelihood approaches are proposed to handle variable selection problems, and it is shown that the newly proposed estimators perform as well as the oracle procedure in variable selection; namely, they work as well if the correct submodel were known.