Sciweavers

96 search results - page 17 / 20
» Optimal neighborhood indexing for protein similarity search
Sort
View
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
14 years 1 months ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
SIGIR
2010
ACM
13 years 2 months ago
The 8th workshop on large-scale distributed systems for information retrieval (LSDS-IR'10)
The size of the Web as well as user bases of search systems continue to grow exponentially. Consequently, providing subsecond query response times and high query throughput become...
Roi Blanco, Berkant Barla Cambazoglu, Claudio Lucc...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 12 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
APWEB
2010
Springer
14 years 9 days ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle