Sciweavers

123 search results - page 16 / 25
» Declarative Querying for Biological Sequences
Sort
View
BMCBI
2006
107views more  BMCBI 2006»
13 years 7 months ago
A reinforced merging methodology for mapping unique peptide motifs in members of protein families
Background: Members of a protein family often have highly conserved sequences; most of these sequences carry identical biological functions and possess similar three-dimensional (...
Hao-Teng Chang, Tun-Wen Pai, Tan-Chi Fan, Bo-Han S...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 7 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
14 years 16 days ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
BMCBI
2006
95views more  BMCBI 2006»
13 years 7 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...