Solving peptide sequencing as satisfiability (Q929155): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.094 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968002053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Horn sets in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of logic problems solvable by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding solutions for extended Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank

Latest revision as of 10:53, 28 June 2024

scientific article
Language Label Description Also known as
English
Solving peptide sequencing as satisfiability
scientific article

    Statements

    Solving peptide sequencing as satisfiability (English)
    0 references
    0 references
    12 June 2008
    0 references
    de novo sequencing
    0 references
    mass spectrometry
    0 references
    propositional logic modelling
    0 references

    Identifiers