Interdisciplinary sciences, computational life sciences
Feb 21, 2019
Many scientific applications entail solving the subgraph isomorphism problem, i.e., given an input pattern graph, find all the subgraphs of a (usually much larger) target graph that are structurally equivalent to that input. Because subgraph isomorph...
IEEE/ACM transactions on computational biology and bioinformatics
Nov 9, 2018
Protein tertiary structure prediction is an important open challenge in bioinformatics and requires effective methods to accurately evaluate the quality of protein 3-D models generated computationally. Many quality assessment (QA) methods have been p...
IEEE/ACM transactions on computational biology and bioinformatics
Nov 5, 2018
Epistasis learning, which is aimed at detecting associations between multiple Single Nucleotide Polymorphisms (SNPs) and complex diseases, has gained increasing attention in genome wide association studies. Although much work has been done on mapping...
PloS one
Aug 22, 2018
This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. The problem addressed is clustering the cities, then using the NEH h...
TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik
Aug 4, 2018
Key message New fast and accurate method for phasing and imputation of SNP chip genotypes within diploid bi-parental plant populations. This paper presents a new heuristic method for phasing and imputation of genomic data in diploid plant species. Ou...
Computational intelligence and neuroscience
Feb 22, 2018
When solving constraint satisfaction problems (CSPs), it is a common practice to rely on heuristics to decide which variable should be instantiated at each stage of the search. But, this ordering influences the search cost. Even so, and to the best o...
Journal of structural and functional genomics
Jan 12, 2017
Protein database search for public databases is a fundamental step in the target selection of proteins in structural and functional genomics and also for inferring protein structure, function, and evolution. Most database search methods employ amino ...
Evolutionary computation
Apr 27, 2016
We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance...
Neural networks : the official journal of the International Neural Network Society
Jan 4, 2016
This paper presents new Radial Basis Function (RBF) learning methods for classification problems. The proposed methods use some heuristics to determine the spreads, the centers and the number of hidden neurons of network in such a way that the higher...
Journal of chemical information and modeling
May 1, 2015
Maximum common substructure search is a computationally hard optimization problem with diverse applications in the field of cheminformatics, including similarity search, lead optimization, molecule alignment, and clustering. Most of these application...