Sciweavers

801 search results - page 37 / 161
» Computational intelligence in solving bioinformatics problem...
Sort
View
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 8 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
BIRTHDAY
2004
Springer
15 years 9 months ago
Engineers Don't Search
Abstract. This paper is on the automation of knowledge-intensive tasks in engineering domains; here, the term “task” relates to analysis and synthesis tasks, such as diagnosis ...
Benno Stein
SAG
2004
Springer
15 years 9 months ago
Modelling a Protein Structure Comparison Application on the Grid Using PROTEUS
Bioinformatics applications manage complex biological data stored into distributed and often heterogeneous databases and require large computing power. Among these, protein structu...
Mario Cannataro, Matteo Comin, Carlo Ferrari, Conc...
EVOW
2008
Springer
15 years 6 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...