PVM algorithms for some problems in bioinformatics Hongmei He Xuan Liu Matthew Newton Ondrej Sykora 2134/2389 https://repository.lboro.ac.uk/articles/online_resource/PVM_algorithms_for_some_problems_in_bioinformatics/9404087 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. 2006-09-27 16:15:21 Smith-Waterman algorithm PVM algorithms longest common string longest repeated string longest palindrome Information and Computing Sciences not elsewhere classified