Sökning: "Hypergraph"
Visar resultat 1 - 5 av 12 avhandlingar innehållade ordet Hypergraph.
1. On hypergraph algebras
Sammanfattning : .... LÄS MER
2. Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness
Sammanfattning : A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks the validity of a PCP proof by reading only 3 bits from it. LÄS MER
3. Parameterized algorithms for hitting set variants applied to protein identification in shotgun proteomics
Sammanfattning : This work is dedicated to problem of protein identification in bottom-up proteomics, and in particular, in shotgun proteomics. It is aimed on providing a new way of interpretation of peak lists. LÄS MER
4. Protein Mixture Inference as Hitting Set Variants and Linear Algebra Problems
Sammanfattning : This work is dedicated to the problems of protein inference and quantification in bottom-up proteomics, and, in particular, in shotgun proteomics. We adopt a rather classical approach of representing inference problem as a set cover, where proteins are understood as sets of their observations: peptides' masses or sequences. LÄS MER
5. Chordal and Complete Structures in Combinatorics and Commutative Algebra
Sammanfattning : This thesis is divided into two parts. The first part is concerned with the commutative algebra of certain combinatorial structures arising from uniform hypergraphs. The main focus lies on two particular classes of hypergraphs called chordal hypergraphs and complete hypergraphs, respectively. LÄS MER
