Sciweavers

18 search results - page 2 / 4
» PatternHunter: faster and more sensitive homology search
Sort
View
BMCBI
2011
12 years 9 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
BMCBI
2005
152views more  BMCBI 2005»
13 years 5 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
Markus Wistrand, Erik L. L. Sonnhammer
CSB
2004
IEEE
142views Bioinformatics» more  CSB 2004»
13 years 9 months ago
FastR: Fast Database Search Tool for Non-Coding RNA
The discovery of novel non-coding RNAs has been among the most exciting recent developments in Biology. Yet, many more remain undiscovered. It has been hypothesized that there is ...
Vineet Bafna, Shaojie Zhang
ECOOP
2009
Springer
14 years 6 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
ECRTS
2006
IEEE
13 years 11 months ago
Sensitivity Analysis for Fixed-Priority Real-Time Systems
At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Lat...
Enrico Bini, Marco Di Natale, Giorgio C. Buttazzo