Sciweavers

41 search results - page 1 / 9
» Solving the Problem of Trans-Genomic Query with Alignment Ta...
Sort
View
TCBB
2008
95views more  TCBB 2008»
14 years 9 months ago
Solving the Problem of Trans-Genomic Query with Alignment Tables
Abstract-- The trans-genomic query (TGQ) problem -- enabling the free query of biological information, even across genomes -- is a central challenge facing bioinformatics. Solution...
Douglas Stott Parker Jr., Ruey-Lung Hsiao, Yi Xing...
92
Voted
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
12 years 12 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
82
Voted
DAWAK
2007
Springer
15 years 3 months ago
Computing Join Aggregates over Private Tables
We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information ov...
Rong She, Ke Wang, Ada Wai-Chee Fu, Yabo Xu
WIDM
2006
ACM
15 years 3 months ago
Bridging relational database history and the web: the XML approach
The preservation of digital artifacts represents an unanswered challenge for the modern information society: XML and its query languages provide an effective environment to addre...
Fusheng Wang, Xin Zhou, Carlo Zaniolo