Sciweavers

41 search results - page 3 / 9
» Solving the Problem of Trans-Genomic Query with Alignment Ta...
Sort
View
GCB
2006
Springer
140views Biometrics» more  GCB 2006»
13 years 11 months ago
PALMA: Perfect Alignments using Large Margin Algorithms
: Despite many years of research on how to properly align sequences in the presence of sequencing errors, alternative splicing and micro-exons, the correct alignment of mRNA sequen...
Gunnar Rätsch, Bettina Hepp, Uta Schulze, Che...
BIOCOMP
2007
13 years 9 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
SIGMOD
2005
ACM
111views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Computation of Multiple Group By Queries
Data analysts need to understand the quality of data in the warehouse. This is often done by issuing many Group By queries on the sets of columns of interest. Since the volume of ...
Zhimin Chen, Vivek R. Narasayya
AAAI
2004
13 years 9 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
14 years 9 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou