Efficient parallel implementation of sequence analysis algorithms using a global address space model

No abstract is available for this paper.

• Publication year

  1992

• Venue

  Mathematical and Computer Modelling

• Publication date

  1992-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/0895-7177(92)90152-B
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An efficient string matching algorithm with k differences for nucleotide and amino acid sequences

  2018cited by this paper
• Theories of Programming Languages: Communicating Sequential Processes

  1998cited by this paper
• Partitioning and Scheduling Parallel Programs for Multiprocessing

  1989cited by this paper
• Probabilistic models of genome shuffling.

  1989cited by this paper
• Using an architectural knowledge base to generate code for parallel computers

  1989cited by this paper
• A continuous analog for RNA folding.

  1989cited by this paper
• Parallel program design

  1989cited by this paper
• The significance of protein sequence similarities

  1988cited by this paper
• Dino: summary and examples

  1988cited by this paper
• Supercomputing in molecular biology: applications to sequence analysis

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

  1988cited by this paper
• The Blaze Family of Languages Programming Parallel Architectures: T H E Blaze Family of Languages

  1988cited by this paper
• Heuristic Rule-Based Program Transformations for Enhanced Vectorization

  1988cited by this paper
• Protein and Nucleic Acid Sequence Database Searching: A Suitable Case for Parallel processing

  1987cited by this paper
• The BLAZE language: A parallel language for scientific programming

  1987cited by this paper
• Automatic decomposition of scientific programs for parallel execution

  1987cited by this paper
• Computer program for the IBM personal computer which searches for approximate matches to short oligonucleotide sequences in long target DNA sequences

  1986cited by this paper
• Heuristic informational analysis of sequences

  1986cited by this paper
• An extension of the language C for concurrent programming

  1986cited by this paper
• Concurrent programming in Ada

  1985cited by this paper
• Programming in Modula-2

  1985cited by this paper
• Principles of Biochemistry

  1984cited by this paper
• Rapid similarity searches of nucleic acid and protein data banks.

  1983cited by this paper
• Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison

  1983cited by this paper
• Pattern recognition in nucleic acid sequences. I. A general method for finding local homologies and symmetries

  1982cited by this paper
• PFC: A Program to Convert Fortran to Parallel Form

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

  1981cited by this paper
• Performance of update algorithms for replicated data

  1981cited by this paper
• Synchronizing Resources

  1981cited by this paper
• Dependence graphs and compiler optimizations

  1981cited by this paper
• Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information

  1981cited by this paper
• The Theory and Computation of Evolutionary Distances: Pattern Recognition

  1980cited by this paper
• High-Speed Multiprocessors and Compilation Techniques

  1980cited by this paper
• High level programming for distributed computing

  1979cited by this paper
• The C Programming Language

  1978cited by this paper
• Computer analysis of nucleic acid regulatory sequences.

  1977cited by this paper
• Programming Languages: Design and Implementation

  1975cited by this paper
• The programming language Concurrent Pascal

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

  1970cited by this paper

• No citing papers are available for this paper.