Sciweavers

901 search results - page 140 / 181
» On Anonymization of String Data
Sort
View
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 6 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
BIBM
2008
IEEE
125views Bioinformatics» more  BIBM 2008»
15 years 3 months ago
On the Role of Local Matching for Efficient Semi-supervised Protein Sequence Classification
Recent studies in protein sequence analysis have leveraged the power of unlabeled data. For example, the profile and mismatch neighborhood kernels have shown significant improveme...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
CIKM
2008
Springer
15 years 3 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
TREC
2007
15 years 2 months ago
Exegy at TREC 2007 Million Query Track
Exegy’s submission for the TREC 2007 million query track consisted of results obtained by running the queries against the raw data, i.e., the data was not indexed. The hardwarea...
Naveen Singla, Ronald S. Indeck
CORR
2007
Springer
177views Education» more  CORR 2007»
15 years 1 months ago
N3Logic: A Logical Framework For the World Wide Web
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi ...