Parallel biological sequence comparison using prefix computations.
From MaRDI portal
Recommendations
Cited in
(11)- An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition
- A bit-parallel, general integer-scoring sequence alignment algorithm
- scientific article; zbMATH DE number 2166160 (Why is no real title available?)
- A parallel algorithm for pattern discovery in biological sequences
- Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
- A parallel strategy for biological sequence alignment in restricted memory space
- Exact parallel alignment of megabase genomic sequences with tunable work distribution
- scientific article; zbMATH DE number 1830949 (Why is no real title available?)
- scientific article; zbMATH DE number 2243049 (Why is no real title available?)
- Experimental and Efficient Algorithms
- scientific article; zbMATH DE number 1955849 (Why is no real title available?)
This page was built for publication: Parallel biological sequence comparison using prefix computations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402116)