503 search results - page 42 / 101 » Parallelism in Gene Assembly |
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
JCB
2000
14 years 9 months ago
2000
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
We discuss real-world case studies involving the implementation of a web services middleware tier for the IBM Blue Gene/L supercomputer to support financial business applications...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...