PVM algorithms for some problems in bioinformatics

We design and analyze implementation aspects of a PVM version of the well known Smith-Waterman algorithm, and then we consider other problems important for bioinformatics, such as finding longest common substring, finding repeated substrings and finding palindromes.

Saved in:
Bibliographic Details
Main Authors: Hongmei He, Xuan Liu, Matthew Newton, Ondrej Sykora
Format: Default Text
Published: 2004
Subjects:
Other information and computing sciences not elsewhere classified
Smith-Waterman algorithm
PVM algorithms
longest common string
longest repeated string
longest palindrome
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2389
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items