Sciweavers

34 search results - page 4 / 7
» Exact match search in sequence data using suffix trees
Sort
View
FOCS
2009
IEEE
13 years 11 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
SCFBM
2008
91views more  SCFBM 2008»
13 years 7 months ago
Simple tools for assembling and searching high-density picolitre pyrophosphate sequence data
Background: The advent of pyrophosphate sequencing makes large volumes of sequencing data available at a lower cost than previously possible. However, the short read lengths are d...
Nicolas J. Parker, Andrew G. Parker
CVIU
2011
13 years 2 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
PETRA
2009
ACM
14 years 1 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
BMCBI
2005
123views more  BMCBI 2005»
13 years 7 months ago
PSI-BLAST-ISS: an intermediate sequence search tool for estimation of the position-specific alignment reliability
Background: Protein sequence alignments have become indispensable for virtually any evolutionary, structural or functional study involving proteins. Modern sequence search and com...
Mindaugas Margelevicius, Ceslovas Venclovas