Associating functional information with biological sequences remains a challenge for machine learning methods. The performance of these methods often depends on deriving predictive features from the sequences sought to be classified. Feature generation is a difficult problem, as the connection between the sequence features and the sought property is not known a priori. It is often the task of domain experts or exhaustive feature enumeration techniques to generate a few features whose predictive power is then tested in the context of classification. This paper proposes an evolutionary algorithm to effectively explore a large feature space and generate predictive features from sequence data. The effectiveness of the algorithm is demonstrated on an important component of the gene-finding problem, DNA splice site prediction. This application is chosen due to the complexity of the features needed to obtain high classification accuracy and precision. Our results test the effectiveness of the obtained features in the context of classification by Support Vector Machines and show significant improvement in accuracy and precision over state-of-the-art approaches.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1109/TCBB.2012.53 | DOI Listing |
ISME J
January 2025
Evolutionary Ecology of Plants, Department of Biology, University of Marburg, 35043 Marburg, Germany.
Land-use changes threaten ecosystems and are a major driver of species loss. Plants may adapt or migrate to resist global change, but this can lag behind rapid anthropogenic changes to the environment. Our data show that natural modulations of the microbiome of grassland plants in response to experimental land-use change in a common garden directly affect plant phenotype and performance, thus increasing plant tolerance.
View Article and Find Full Text PDFBrief Bioinform
November 2024
School of Electrical and Information Engineering, Zhengzhou University, No. 100, Science Avenue, Hightech District, Zhengzhou City 450001, Henan Province, China.
Structural network control principles provided novel and efficient clues for the optimization of personalized drug targets (PDTs) related to state transitions of individual patients. However, most existing methods focus on one subnetwork or module as drug targets through the identification of the minimal set of driver nodes and ignore the state transition capabilities of other modules with different configurations of drug targets [i.e.
View Article and Find Full Text PDFSci Rep
January 2025
Information Initiative Center, Hokkaido University, Sapporo, Japan.
This research utilizes time series models to forecast electricity generation from renewable energy sources and electricity consumption. The configuration of optimal parameters for these models typically requires optimization algorithms, but conventional algorithms may struggle with fixed search patterns and limited robustness. To address this, we propose an auto-evolution hyper-heuristic algorithm named AE-GAPB.
View Article and Find Full Text PDFEvol Comput
January 2025
Sorbonne Université, CNRS, ISIR., Paris, 75005, France
Quality-Diversity (QD) methods are algorithms that aim to generate a set of diverse and highperforming solutions to a given problem. Originally developed for evolutionary robotics, most QD studies are conducted on a limited set of domains'mainly applied to locomotion, where the fitness and the behavior signal are dense. Grasping is a crucial task for manipulation in robotics.
View Article and Find Full Text PDFEvol Comput
January 2025
Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany
Evolutionary algorithms make countless random decisions during selection, mutation and crossover operations. These random decisions require a steady stream of random numbers. We analyze the expected number of random bits used throughout a run of an evolutionary algorithm and refer to this as the cost of randomness.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!