AIMC Topic: Computer Heuristics

Clear Filters Showing 11 to 20 of 26 articles

Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics.

Interdisciplinary sciences, computational life sciences
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...

Two New Heuristic Methods for Protein Model Quality Assessment.

IEEE/ACM transactions on computational biology and bioinformatics
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...

Introducing Heuristic Information Into Ant Colony Optimization Algorithm for Identifying Epistasis.

IEEE/ACM transactions on computational biology and bioinformatics
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...

Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic.

PloS one
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...

A heuristic method for fast and accurate phasing and imputation of single-nucleotide polymorphism data in bi-parental plant populations.

TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik
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...

Exploring the Impact of Early Decisions in Variable Ordering for Constraint Satisfaction Problems.

Computational intelligence and neuroscience
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...

Protein sequence-similarity search acceleration using a heuristic algorithm with a sensitive matrix.

Journal of structural and functional genomics
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 ...

A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.

Evolutionary computation
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...

Two fast and accurate heuristic RBF learning rules for data classification.

Neural networks : the official journal of the International Neural Network Society
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...

Efficient heuristics for maximum common substructure search.

Journal of chemical information and modeling
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...