HE, at al, 2004. PVM algorithms for some problems in bioinformatics. IN: Proceedings of the Workshop on Information Technologies - Applications and Theory (ITAT), Slovakia, September 15-19
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.