Sciweavers

662 search results - page 63 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
BMCBI
2004
208views more  BMCBI 2004»
13 years 7 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
BMCBI
2007
148views more  BMCBI 2007»
13 years 7 months ago
Blast sampling for structural and functional analyses
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
Anne Friedrich, Raymond Ripp, Nicolas Garnier, Emm...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 2 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
ICASSP
2011
IEEE
12 years 11 months ago
A general framework for robust HOSVD-based indexing and retrieval with high-order tensor data
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
Qun Li, Xiangqiong Shi, Dan Schonfeld
KDD
1994
ACM
82views Data Mining» more  KDD 1994»
13 years 12 months ago
Architectural Support for Data Mining
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...
Marcel Holsheimer, Martin L. Kersten