A grid service based on suffix trees for pattern extraction from mass spectrometry proteomics data

Authors:
M. Cannataro;P. Veltri
Affiliations:
University Magna Græcia of Catanzaro, Italy;University Magna Græcia of Catanzaro, Italy
Venue:
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Year:
2006

Citing 3
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Preprocessing of Mass Spectrometry Proteomics Data on the Grid

CBMS '05 Proceedings of the 18th IEEE Symposium on Computer-Based Medical Systems
Using ontologies for preprocessing and mining spectra data on the grid

Future Generation Computer Systems - Special section: Data mining in grid computing environments

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a Grid Service allowing to detect and extract the longest common sub-spectrum among a set of mass spectrometry spectra data. The system uses a novel pattern extraction algorithm named LCSS (Longest Common Spectra SubString) that adapts a very popular string matching technique based on Suffix Trees to spectra data. The basic LCSS algorithm made available as a Grid Service is used to implement a pattern extraction workflow on mass spectrometry dataset. First experimental results are presented.