Sciweavers

673 search results - page 45 / 135
» Querying Continuous Time Sequences
Sort
View
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 7 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
BMCBI
2004
156views more  BMCBI 2004»
15 years 4 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
ICDE
2009
IEEE
278views Database» more  ICDE 2009»
16 years 6 months ago
Probabilistic Skyline Operator over Sliding Windows
Abstract-- Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of efficient processing of continuous skyline que...
Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang 001...
TKDE
2010
200views more  TKDE 2010»
15 years 2 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
BIOCOMP
2007
15 years 6 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci