A parallel strategy for biological sequence alignment in restricted memory space

DOI10.1016/J.JPDC.2007.08.007zbMath1243.68331OpenAlexW2007362861MaRDI QIDQ436758

Azzedine Boukerche, Rodolfo Bezerra Batista, Alba Cristina Magalhaes Alves De Melo

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.08.007

zbMATH Keywords

high performance computingDNA sequencingbiological inspired technique

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (1)

EXACT PARALLEL ALIGNMENT OF MEGABASE GENOMIC SEQUENCES WITH TUNABLE WORK DISTRIBUTION

Uses Software

• FastLSA

Cites Work

• Unnamed Item
• Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
• Optimal sequence alignment using affine gap costs
• Parallel biological sequence comparison using prefix computations.
• FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
• A linear space algorithm for computing maximal common subsequences
• Algorithms on Strings, Trees and Sequences
• Experimental and Efficient Algorithms

This page was built for publication: A parallel strategy for biological sequence alignment in restricted memory space