✦ LIBER ✦

A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor

✍ Scribed by Xiaoqiu Huang

Publisher: Springer
Year: 1989
Tongue: English
Weight: 739 KB
Volume: 18
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf01407900

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modeling and evaluation of a new message

Modeling and evaluation of a new message-passing system for parallel multiprocessor systems

✍ Helnye Azaria; Yuval Elovici 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 925 KB

Data reduction and fast routing: A strat

Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers

✍ Jorge L. C. Sanz; Robert Cypher 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 880 KB

A parallel algorithm for computing eigen

A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures

✍ Susanne Balle; Jane Cullum 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 203 KB

FastLSA: A Fast, Linear-Space, Parallel

FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment

✍ Adrian Driga; Paul Lu; Jonathan Schaeffer; Duane Szafron; Kevin Charter; Ian Par 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 370 KB

An efficient polynomial space and polyno

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

✍ Hiroki Arimura; Takeaki Uno 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 611 KB

A simple and space-efficient fragment-ch

A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences

✍ B. Morgenstern 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 534 KB

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is de