Sciweavers

333 search results - page 22 / 67
» Speeding up moving-target search
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
56
Voted
ICDM
2009
IEEE
141views Data Mining» more  ICDM 2009»
15 years 4 months ago
Scalable Algorithms for Distribution Search
Distribution data naturally arise in countless domains, such as meteorology, biology, geology, industry and economics. However, relatively little attention has been paid to data m...
Yasuko Matsubara, Yasushi Sakurai, Masatoshi Yoshi...
ISMB
2000
14 years 11 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
ECML
2007
Springer
15 years 4 months ago
Exploiting Term, Predicate, and Feature Taxonomies in Propositionalization and Propositional Rule Learning
Knowledge representations using semantic web technologies often provide information which translates to explicit term and predicate taxonomies in relational learning. We show how t...
Monika Záková, Filip Zelezný
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
15 years 3 months ago
An Evolutionary Approach with Pharmacophore-Based Scoring Functions for Virtual Database Screening
We have developed a new tool for virtual database screening. This tool, referred to as the Generic Evolutionary Method for molecular DOCKing (GEMDOCK), combines an evolutionary app...
Jinn-Moon Yang, Tsai-Wei Shen, Yen-Fu Chen, Yi-Yua...