Loughborough University
Browse
HLNS04.pdf (236.25 kB)

PVM algorithms for some problems in bioinformatics

Download (236.25 kB)
online resource
posted on 2006-09-27, 16:15 authored by Hongmei He, Xuan Liu, Matthew Newton, Ondrej Sykora
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.

History

School

  • Science

Department

  • Computer Science

Pages

214453 bytes

Citation

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

Publication date

2004

Notes

This is a conference paper

Language

  • en