Sciweavers

32 search results - page 6 / 7
» An Incremental Prefix Filtering Approach for the All Pairs S...
Sort
View
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
13 years 10 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
BMCBI
2006
164views more  BMCBI 2006»
13 years 5 months ago
Evaluation of clustering algorithms for gene expression data
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
Susmita Datta, Somnath Datta
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
13 years 11 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
BMCBI
2007
121views more  BMCBI 2007»
13 years 5 months ago
A procedure for identifying homologous alternative splicing events
Background: The study of the functional role of alternative splice isoforms of a gene is a very active area of research in biology. The difficulty of the experimental approach (in...
David Talavera, Adam Hospital, Modesto Orozco, Xav...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 11 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