Sciweavers

3928 search results - page 3 / 786
» Optimal suffix selection
Sort
View
RECOMB
2002
Springer
14 years 6 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 6 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
ICMCS
2009
IEEE
250views Multimedia» more  ICMCS 2009»
13 years 3 months ago
Efficient sparse self-similarity matrix construction for repeating sequence detection
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
Lei Wang, Chng Eng Siong, Haizhou Li
CORR
2004
Springer
76views Education» more  CORR 2004»
13 years 5 months ago
Improved Upper Bound for the Redundancy of Fix-Free Codes
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
Sergey Yekhanin
FOCS
2009
IEEE
13 years 9 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter