Sökning: "NP-hardness"
Visar resultat 1 - 5 av 7 avhandlingar innehållade ordet NP-hardness.
1. Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming
Sammanfattning : 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. LÄS MER
2. Exact Algorithms for Exact Satisfiability Problems
Sammanfattning : 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. 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. Consensus Algorithms for Trees and Strings
Sammanfattning : 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. LÄS MER
5. Computational problems in evolution : Multiple alignment, genome rearrangements, and tree reconstruction
Sammanfattning : 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. LÄS MER