5404 search results - page 370 / 1081 » Global Computing for Bioinformatics |
172
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
172
click to vote
IEEEPACT
2005
IEEE
16 years 8 days ago
2005
IEEE
While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures sin...
160
click to vote
SC
2005
ACM
16 years 7 days ago
2005
ACM
ng Abstractions from Resources in a Tactical Storage System Douglas Thain† , Sander Klous∗ , Justin Wozniak† , Paul Brenner† , Aaron Striegel† , Jesus Izaguirre† † - ...
156
click to vote
DNA
2005
Springer
16 years 6 days ago
2005
Springer
In the field of DNA computing, more and more efforts are made for constructing molecular machines made of DNA that work in vitro or in vivo. States of some of those machines are...
169
click to vote
WABI
2004
Springer
16 years 1 days ago
2004
Springer
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...