Domain enhanced lookup time accelerated BLAST
نویسندگان
چکیده
منابع مشابه
GPU-accelerated name lookup with component encoding
1389-1286/$ see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.comnet.2013.07.006 q This work is supported by NSFC (61073171), Tsinghua University Initiative Scientific Research Program (20121080068), 863 project (2013AA013502). ⇑ Corresponding author. Tel.: +86 1062773441. E-mail address: [email protected] (B. Liu). Yi Wang, Huichen Dai, Ting Zhang, Wei Men...
متن کاملDAMAGE DETECTION OF BRIDGE STRUCTURES IN TIME DOMAIN VIA ENHANCED COLLIDING BODIES OPTIMIZATION
In this paper, a method is presented for damage detection of bridges using the Enhanced Colliding Bodies Optimization (ECBO) utilizing time-domain responses. The finite element modeling of the structure is based on the equation of motion under the moving load, and the flexural stiffness of the structure is determined by the acceleration responses obtained via sensors placed in d...
متن کاملAccelerated BLAST Performance with Tera-BLASTTM: a comparison of FPGA versus GPU and CPU BLAST implementations
A number of technologies have emerged for accelerating similarity search algorithms in bioinformatics, including the use of field programmable gate arrays (FPGA), graphics processing units (GPU), and clusters of standard multicore CPUs. Here we present Tera-BLASTTM, an FPGA-accelerated implementation of the BLAST algorithm, and compare the performance to GPU-accelerated BLAST and the industry s...
متن کاملEnhanced Property Specification and Verification in BLAST
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules. The source code under verification is instrumented by artificial variables and statements in order to transform the problem of checking such a rule into the problem of program location reachability. This way, the sou...
متن کاملEnhanced Lookup Queries for Large-Scale Distributed Data Structures
Structured peer-to-peer systems are a class of distributed data structures that provided initially only exact-match queries in a scalable way. Exactmatch queries consist of retrieving single values from the network (i.e., put(key, value)/value←get(key)), in such a way that if the data exists, it is returned. Unfortunately, this service is not enough for modern distributed and parallel applicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biology Direct
سال: 2012
ISSN: 1745-6150
DOI: 10.1186/1745-6150-7-12