A parallel strategy for biological sequence alignment in restricted memory space
From MaRDI portal
(Redirected from Publication:436758)
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
Cites work
- scientific article; zbMATH DE number 808499 (Why is no real title available?)
- A linear space algorithm for computing maximal common subsequences
- Algorithms on Strings, Trees and Sequences
- Experimental and Efficient Algorithms
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
- Optimal sequence alignment using affine gap costs
- Parallel biological sequence comparison using prefix computations.
- Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
Cited in
(8)- Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
- Fast vectorized distance matrix computation for multiple sequence alignment on multi-cores
- Accelerating computation of DNA sequence alignment in distributed environment
- Exact parallel alignment of megabase genomic sequences with tunable work distribution
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
- Experimental and Efficient Algorithms
- Parallel strategies for the local biological sequence alignment in a cluster of workstations
- scientific article; zbMATH DE number 1955849 (Why is no real title available?)
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)