Sciweavers

404 search results - page 29 / 81
» Structure Discovery from Sequential Data
Sort
View
WWW
2001
ACM
15 years 10 months ago
IEPAD: information extraction based on pattern discovery
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
Chia-Hui Chang, Shao-Chen Lui
NAR
2006
108views more  NAR 2006»
14 years 9 months ago
GLIDA: GPCR-ligand database for chemical genomic drug discovery
G-protein coupled receptors (GPCRs) represent one of the most important families of drug targets in pharmaceutical development. GPCR-LIgand DAtabase (GLIDA) is a novel public GPCR...
Yasushi Okuno, Jiyoon Yang, Kei Taneishi, Hiroaki ...
IFIP
2004
Springer
15 years 3 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
15 years 10 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
14 years 8 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo