Skip to main content
Springer Nature Link
Log in

A Grid Service Based on Suffix Trees for Pattern Extraction from Mass Spectrometry Proteomics Data

  • Conference paper
Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops (ISPA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4331))

  • 533 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aebersold, R., Mann, M.: Mass spectrometry-based proteomics. Nature 422, 198–207 (2003)

    Article  Google Scholar 

  2. Cannataro, M., Guzzi, P., Mazza, T., Tradigo, G., Veltri, P.: Preprocessing of mass spectrometry proteomics data on the grid. In: CBMS 2005, pp. 549–554. IEEE Press, Los Alamitos (2005)

    Google Scholar 

  3. Cannataro, M., Guzzi, P., Mazza, T., Tradigo, G., Veltri, P.: Using ontologies for preprocessing and mining spectra data on the grid. Future Generation Comp. Syst. 23(1), 55–60 (2007)

    Article  Google Scholar 

  4. Alliance Globus. The globus project, http://www.globus.org/

  5. Gopalakrishnan, V., William, E., Ranganathan, S., Bowser, R., Cudkowic, M.E., Novelli, M., Lattazi, W., Gambotto, A., Day, B.W.: Proteomic data mining challenges in identification of disease-specific biomarkers from variable resolution mass spectra. In: Proceedings of SIAM Bioinformatics Workshop 2004, Buena Vista, FL, April 2004, pp. 1–10 (2004)

    Google Scholar 

  6. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Magna Græcia of Catanzaro, Italy

    M. Cannataro & P. Veltri

Authors
  1. M. Cannataro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Veltri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, School of Informatics, University of Bradford, BD7 1DP, Bradford, U.K.

    Geyong Min

  2. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy

    Beniamino Di Martino

  3. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  5. Department of Computer Science, Chemnitz University of Technology, Germany

    Gudula Rünger

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cannataro, M., Veltri, P. (2006). A Grid Service Based on Suffix Trees for Pattern Extraction from Mass Spectrometry Proteomics Data. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_68

Download citation

  • DOI: https://doi.org/10.1007/11942634_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49860-5

  • Online ISBN: 978-3-540-49862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation