Sciweavers

9 search results - page 2 / 2
» Fast and space efficient string kernels using suffix arrays
Sort
View
FOCS
2009
IEEE
15 years 3 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
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
15 years 3 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
JMLR
2008
148views more  JMLR 2008»
14 years 11 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
BMCBI
2006
129views more  BMCBI 2006»
14 years 11 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...