Search for dissertations about: "NP-hardness"
Showing result 1 - 5 of 7 swedish dissertations containing the word NP-hardness.
-
1. Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming
Abstract : Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. READ MORE
-
2. Exact Algorithms for Exact Satisfiability Problems
Abstract : This thesis presents exact means to solve a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (XSAT) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. READ MORE
-
3. Parameterized algorithms for hitting set variants applied to protein identification in shotgun proteomics
Abstract : 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. READ MORE
-
4. Consensus Algorithms for Trees and Strings
Abstract : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. READ MORE
-
5. Computational problems in evolution : Multiple alignment, genome rearrangements, and tree reconstruction
Abstract : Reconstructing the evolutionary history of a set of species is a fundamental problem in biology. This thesis concerns computational problems that arise in different settings and stages of phylogenetic tree reconstruction, but also in other contexts. READ MORE