We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and affine gap penalty functions, full-sequence and subsequence matching, and space-saving algorithms. Commonly used sequential
β¦ LIBER β¦
A parallel Poisson generator using parallel prefix
β Scribed by Tan-Chun Lu; Yu-Song Hou; Rong-Jaye Chen
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 474 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Parallel biological sequence comparison
β
Srinivas Aluru; Natsuhiko Futamura; Kishan Mehrotra
π
Article
π
2003
π
Elsevier Science
π
English
β 217 KB
Limited width parallel prefix circuits
β
David A. Carlson; Binay Sugla
π
Article
π
1990
π
Springer US
π
English
β 867 KB
In this paper, we present lower and upper bounds on the size of limited width, bounded and unbounded fan-out parallel prefix circuits. The lower bounds on the sizes of such circuits are a function of the depth, width, and number of inputs. The size requirement of an N input bounded fan-out parallel
Parallel prefix computation on a pyramid
β
L. Cinque; G. Bongiovanni
π
Article
π
1995
π
Elsevier Science
π
English
β 241 KB
Parallel general prefix computations wit
β
Frederick Springsteel; Ivan StojmenoviΔ
π
Article
π
1989
π
Springer
π
English
β 896 KB
Parallel Poisson and Biharmonic solvers
β
A. H. Sameh; S. C. Chen; D. J. Kuck
π
Article
π
1976
π
Springer Vienna
π
English
β 593 KB
Pipelined Parallel Prefix Computations,
β
Ernst W. Mayr; C.Greg Plaxton
π
Article
π
1993
π
Elsevier Science
π
English
β 601 KB