Sciweavers

405 search results - page 32 / 81
» Efficient decision tree construction on streaming data
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
ICMLA
2007
13 years 9 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis
DCC
1998
IEEE
13 years 12 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 9 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
TKDE
1998
122views more  TKDE 1998»
13 years 7 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar