Sciweavers

342 search results - page 14 / 69
» Combinatorial Framework for Similarity Search
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
PROSIDIS: A Special Purpose Processor for PROtein SImilarity DIScovery
This work presents the architecture of PROSIDIS, a special purpose processor designed to search for the occurrence of substrings similar to a given ‘template string’ within a ...
Alessandro Marongiu, Paolo Palazzari, Vittorio Ros...
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 7 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
14 years 3 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius
RECOMB
2006
Springer
14 years 9 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
DATAMINE
2006
88views more  DATAMINE 2006»
13 years 8 months ago
Hyperclique pattern discovery
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
Hui Xiong, Pang-Ning Tan, Vipin Kumar