Exploiting different levels of parallelism in the biological sequence comparison problem

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Unknown venue

• Publication date

  2009-04-23

• Fields of study

  Biology, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment

  2008cited by this paper
• Optimization principles and application performance evaluation of a multithreaded GPU using CUDA

  2008cited by this paper
• IBM POWER6 microarchitecture

  2007cited by this paper
• Exploring the Viability of the Cell Broadband Engine for Bioinformatics Applications

  2007cited by this paper
• A parallel dynamic programming algorithm on a multi-core architecture

  2007cited by this paper
• Performance Analysis of Sequence Alignment Applications

  2006cited by this paper
• Introduction to the Cell multiprocessor

  2005cited by this paper
• Parallel strategies for local biological sequence alignment in a cluster of workstations

  2005cited by this paper
• The EMBL Nucleotide Sequence Database

  2004cited by this paper
• Rapid and sensitive methods for protein sequence comparison and database searching

  2001cited by this paper
• The EMBL Nucleotide Sequence Database

  2000cited by this paper
• Strategies for searching sequence databases.

  2000cited by this paper
• The early introduction of dynamic programming into computational biology

  2000cited by this paper
• Blocks+: a non-redundant database of protein alignment blocks derived from multiple compilations

  1999cited by this paper
• Parallel hardware for sequence comparison and alignment

  1996cited by this paper
• CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice.

  1994cited by this paper
• Amino acid substitution matrices from protein blocks.

  1992cited by this paper
• Comparing machine-independent versus machine-specific parallelization of a software platform for biological sequence comparison

  1992cited by this paper
• A systolic array processor for biological information signal processing

  1991cited by this paper
• Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms.

  1991cited by this paper
• A platform for biological sequence comparison on parallel computers

  1990cited by this paper
• Basic local alignment search tool.

  1990cited by this paper
• Improved tools for biological sequence comparison.

  1988cited by this paper
• An improved algorithm for matching biological sequences.

  1982cited by this paper
• Identification of common molecular subsequences.

  1981cited by this paper
• Chapter 22: A model of evolutionary change in proteins

  1978cited by this paper
• A model of evolutionary change in protein

  1978cited by this paper
• On the Theory and Computation of Evolutionary Distances

  1974cited by this paper
• A general method applicable to the search for similarities in the amino acid sequence of two proteins.

  1970cited by this paper
• Atlas of protein sequence and structure

  1965cited by this paper

• No citing papers are available for this paper.