Sökning: "Hitting Set"

Hittade 4 avhandlingar innehållade orden Hitting Set.

1. 1. Protein Mixture Inference as Hitting Set Variants and Linear Algebra Problems

   Författare :Leonid Molokov; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Union Editing; Shotgun proteomics; Parameterized complexity; Protein Inference; Shared Peptides; Set Cover; Hypergraph; Hitting Set; Fixed Parameter Tractable; Protein Quan- ti; Star Editing;

   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

3. 2. Parameterized algorithms for hitting set variants applied to protein identification in shotgun proteomics

   Författare :Leonid Molokov; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Union Editing; Fixed Parameter Tractable; Shotgun proteomics; Hitting Set; Parameterized complexity; Hypergraph; Set Cover;

   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. 3. Algorithms, measures and upper bounds for satisfiability and related problems

   Författare :Magnus Wahlström; Peter Jonsson; Oliver Kullmann; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Exact algorithms; upper bounds; algorithm analysis; satisfiability; Computer science; Datavetenskap;

   Sammanfattning : The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. LÄS MER

5. 4. Complexity and Error Analysis of Numerical Methods for Wireless Channels, SDE, Random Variables and Quantum Mechanics

   Författare :Håkon Hoel; Anders Szepessy; Helse Holden; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Wireless Channels; SDE; Monte Carlo Methods; Molecular Dynamics; Quantum Mechanics;

   Sammanfattning : This thesis consists of the four papers which consider different aspects of stochastic process modeling, error analysis, and minimization of computational cost.     In Paper I, we construct a Multipath Fading Channel (MFC) model for wireless channels with noise introduced through scatterers flipping on and off. LÄS MER