A parallel strategy for biological sequence alignment in restricted memory space
DOI10.1016/J.JPDC.2007.08.007zbMATH Open1243.68331OpenAlexW2007362861MaRDI QIDQ436758FDOQ436758
Authors: Rodolfo Bezerra Batista, Azzedine Boukerche, 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
Recommendations
- Parallel strategies for the local biological sequence alignment in a cluster of workstations
- Exact parallel alignment of megabase genomic sequences with tunable work distribution
- Experimental and Efficient Algorithms
- Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
Protein sequences, DNA sequences (92D20) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)
Cites Work
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
- Algorithms on Strings, Trees and Sequences
- A linear space algorithm for computing maximal common subsequences
- Title not available (Why is that?)
- Optimal sequence alignment using affine gap costs
- Parallel biological sequence comparison using prefix computations.
- Experimental and Efficient Algorithms
- Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
Cited In (8)
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
- Title not available (Why is that?)
- Fast vectorized distance matrix computation for multiple sequence alignment on multi-cores
- Exact parallel alignment of megabase genomic sequences with tunable work distribution
- Accelerating computation of DNA sequence alignment in distributed environment
- Parallel strategies for the local biological sequence alignment in a cluster of workstations
- Experimental and Efficient Algorithms
- Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
Uses Software
This page was built for publication: A parallel strategy for biological sequence alignment in restricted memory space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436758)
