Solving peptide sequencing as satisfiability

DOI10.1016/j.camwa.2006.12.094zbMath1137.92308OpenAlexW1968002053MaRDI QIDQ929155

Renato Bruni

Publication date: 12 June 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.094

zbMATH Keywords

mass spectrometryde novo sequencingpropositional logic modelling

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

A logic-based approach to polymer sequence analysis

Uses Software

• Leibniz

Cites Work

• On finding solutions for extended Horn formulas
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Polynomial-time inference of all valid implications for Horn and related formulae
• Extended Horn sets in propositional logic
• A class of logic problems solvable by linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving peptide sequencing as satisfiability