- No file added yet -
PVM algorithms for some problems in bioinformatics
online resource
posted on 2006-09-27, 16:15 authored by Hongmei He, Xuan Liu, Matthew Newton, Ondrej SykoraWe 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 bytesCitation
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-19Publication date
2004Notes
This is a conference paperLanguage
- en
