Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2389

Title: PVM algorithms for some problems in bioinformatics
Authors: He, H.
Liu, Xuan
Newton, Matthew
Sykora, Ondrej
Keywords: Smith-Waterman algorithm
PVM algorithms
longest common string
longest repeated string
longest palindrome
Issue Date: 2004
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
Abstract: 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.
Description: This is a conference paper
URI: https://dspace.lboro.ac.uk/2134/2389
Appears in Collections:Conference Papers (Computer Science)

Files associated with this item:

File Description SizeFormat
HLNS04.pdf236.25 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.