✦ LIBER ✦

BLAZE™: An implementation of the Smith-Waterman sequence comparison algorithm on a massively parallel computer

✍ Scribed by Douglas L. Brutlag; Jean-Pierre Dautricourt; Ron Diaz; Jeff Fier; Bruce Moxon; Richard Stamm

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 524 KB
Volume: 17
Category: Article
ISSN: 0097-8485
DOI: 10.1016/0097-8485(93)85011-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel implementation of

An efficient parallel implementation of the Monte Carlo particle simulation algorithm on a network of personal computers

✍ Robert R. van Zyl; Willem J. Perold; Hans Grobler 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 3 views

An efficient implementation of the finit

An efficient implementation of the finite-element time-domain algorithm on parallel computers using a finite-element tearing and interconnecting algorithm

✍ Umesh D. Navsariwala; Stephen D. Gedney 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 3 views

An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges