Sciweavers

90 search results - page 12 / 18
» Exploiting Geometrical Properties on Protein Similarity Sear...
Sort
View
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
BMCBI
2011
14 years 4 months ago
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alex...
BMCBI
2005
132views more  BMCBI 2005»
14 years 9 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
DEXA
2006
Springer
126views Database» more  DEXA 2006»
14 years 11 months ago
Hypersphere Indexer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
Navneet Panda, Edward Y. Chang, Arun Qamra
CVPR
2007
IEEE
15 years 11 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell