Sciweavers

40 search results - page 7 / 8
» Fast Searching in Packed Strings
Sort
View
BMCBI
2007
124views more  BMCBI 2007»
15 years 3 months ago
Protein structural similarity search by Ramachandran codes
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...
Wei-Cheng Lo, Po-Jung Huang, Chih-Hung Chang, Ping...
NAR
2011
189views Computer Vision» more  NAR 2011»
14 years 6 months ago
EDULISS: a small-molecule database with data-mining and pharmacophore searching capabilities
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...
Kun-Yi Hsin, Hugh P. Morgan, Steven R. Shave, Andr...
FCCM
2004
IEEE
141views VLSI» more  FCCM 2004»
15 years 7 months ago
Deep Packet Filter with Dedicated Logic and Read Only Memories
Searching for multiple string patterns in a stream of data is a computationally expensive task. The speed of the search pattern module determines the overall performance of deep p...
Young H. Cho, William H. Mangione-Smith
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
14 years 6 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
15 years 10 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala