Peptide analysis is one of the most important and frequent issues in biological and medical research. This holds even more after the beginning of the Proteome Project, focused indeed on the study of proteins. In particular, a basic problem is the determination of the aminoacid sequence of an unknown peptide by processing the data obtained from the tandem mass spectrometry analysis. In practical cases, due to the very large number of possible peptides, such sequencing cannot rely on data bases, and the problem is known as "peptide de novo sequencing". The problem have been approached in many ways, but most of such approaches can only solve very rough simplifications of the real problem. In particular, due to its computationally demanding nature and its inherent combinatorial nature, discrete mathematical approaches to the problem should be used. We therefore present here a new construction for approaching the problem of determining all aminoacid sequences compatible with the given spectral data as a propositional satisfiability problem. Successful results on real-world peptide analysis problems are presented.

De Novo Peptide Sequencing via Tandem Mass Spectometry and Propositional Satisfiability / Bruni, Renato. - STAMPA. - (2006). (Intervento presentato al convegno FIMA International Conference “Models and Methods for Human Genomics” tenutosi a Aosta).

De Novo Peptide Sequencing via Tandem Mass Spectometry and Propositional Satisfiability

BRUNI, Renato
2006

Abstract

Peptide analysis is one of the most important and frequent issues in biological and medical research. This holds even more after the beginning of the Proteome Project, focused indeed on the study of proteins. In particular, a basic problem is the determination of the aminoacid sequence of an unknown peptide by processing the data obtained from the tandem mass spectrometry analysis. In practical cases, due to the very large number of possible peptides, such sequencing cannot rely on data bases, and the problem is known as "peptide de novo sequencing". The problem have been approached in many ways, but most of such approaches can only solve very rough simplifications of the real problem. In particular, due to its computationally demanding nature and its inherent combinatorial nature, discrete mathematical approaches to the problem should be used. We therefore present here a new construction for approaching the problem of determining all aminoacid sequences compatible with the given spectral data as a propositional satisfiability problem. Successful results on real-world peptide analysis problems are presented.
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/498872
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact