Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710047zbMATH OpenOpenAlexFDO

Authors Alba Cristina Magalhaes Alves De Melo, Mauricio Ayala-Rincón, Thomas M. Santana, Azzedine Boukerche

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computational methods for problems pertaining to biology (92-08) Protein sequences, DNA sequences (92D20)

Recommendations

• Parallel strategies for the local biological sequence alignment in a cluster of workstations
• Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
• A parallel strategy for biological sequence alignment in restricted memory space
• scientific article; zbMATH DE number 1830949
• Parallel biological sequence comparison using prefix computations.

Cited in

(11)

• Parallel biological sequence comparison using prefix computations.
• Exact parallel alignment of megabase genomic sequences with tunable work distribution
• A parallel algorithm for large-scale multiple sequence alignment
• A parallel strategy for biological sequence alignment in restricted memory space
• scientific article; zbMATH DE number 1830949 (Why is no real title available?)
• scientific article; zbMATH DE number 1875366 (Why is no real title available?)
• scientific article; zbMATH DE number 1887338 (Why is no real title available?)
• Computational Science – ICCS 2005
• Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
• Parallel strategies for the local biological sequence alignment in a cluster of workstations
• Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors

This page was built for publication: Experimental and Efficient Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710047)