A parallel algorithm for the constrained multiple sequence alignment problem designed for GPUs

DOI10.1142/S0129054112500098MaRDI QIDQ4902884zbMATH OpenOpenAlexFDO

Authors Adam Gudyś, Sebastian Deorowicz

Publication date 18 January 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054112500098

zbMATH Keywords

parallel algorithmsconstrained sequence alignmentGPU general processingprotein comparison

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40)

Recommendations

• Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors
• A fast algorithm for the constrained multiple sequence alignment problem
• scientific article; zbMATH DE number 2243049
• A parallel algorithm for large-scale multiple sequence alignment
• Parallel Identifying (l,d)-Motifs in Biosequences Using CPU and GPU Computing

Cites work

• Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors
• Algorithms on Strings, Trees and Sequences
• An algorithm and applications to sequence alignment with weighted constraints
• Generalized Polykays, an Extension of Simple Polykays and Bipolykays

Cited in

(4)

• On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
• Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors
• Fast vectorized distance matrix computation for multiple sequence alignment on multi-cores
• Euro-Par 2004 Parallel Processing

Describes a project that uses

Uses Software

• CUDA
• Kalign

This page was built for publication: A parallel algorithm for the constrained multiple sequence alignment problem designed for GPUs

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