Solving peptide sequencing as satisfiability

Authors:
Renato Bruni
Affiliations:
Dip. di Ingegneria Elettronica e dell'Informazione, Universití di Perugia, Via G. Duranti, 93 - I-06125 Perugia, Italy
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 6
Cited 0

Extended Horn sets in propositional logic

Journal of the ACM (JACM)
On finding solutions for extended Horn formulas

Information Processing Letters
A class of logic problems solvable by linear programming

Journal of the ACM (JACM)
Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On de novo interpretation of tandem mass spectra for peptide identification

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology

Quantified Score

Hi-index	0.09

Visualization

Abstract

This paper presents an approach for determining the amino acid sequence of a peptide through the solution of propositional satisfiability problems. Data obtained from the mass spectrometry analysis of a peptide are used to build a propositional logic formula, whose models represent coherent interpretations of that set of data and can be used to generate all possible correct results of the analysis itself. Some computational results on real-world peptide analysis problems are reported, which show the effectiveness of our approach.