Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm

MaRDI QIDQ866078zbMATH OpenFDO

Authors Fa Zhang, Xiangzhen Qiao, Zhi-Yong Liu

Publication date 20 February 2007

Published in Science in China. Series F (Search for Journal in Brave)

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Systems biology, networks (92C42) Nonnumerical algorithms (68W05) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Experimental and Efficient Algorithms
• Parallel strategies for the local biological sequence alignment in a cluster of workstations
• A parallel strategy for biological sequence alignment in restricted memory space
• Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors
• Parallel biological sequence comparison using prefix computations.

Cited in

(5)

• Recognising online spatial activities using a bioinformatics inspired sequence alignment approach
• Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors
• A parallel strategy for biological sequence alignment in restricted memory space
• Experimental and Efficient Algorithms
• Parallel strategies for the local biological sequence alignment in a cluster of workstations

This page was built for publication: Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm

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