Search for dissertations about: "computer science biology"
Showing result 1 - 5 of 90 swedish dissertations containing the words computer science biology.
-
1. 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
-
2. Constructing Evolutionary Trees - Algorithms and Complexity
Abstract : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. READ MORE
-
3. Long bone growth and evolution revealed by three-dimensional imaging
Abstract : Propagation phase-contrast synchrotron radiation microtomography is a non-destructive method used for studying histology in three dimensions (3D). Using it, the 3D organization of the diaphyseal cortical vascularization in the humerus of two seymouriamorphs was analyzed in this thesis. READ MORE
-
4. Reconciling gene family evolution and species evolution
Abstract : Species evolution can often be adequately described with a phylogenetic tree. Interestingly, this is the case also for the evolution of homologous genes; a gene in an ancestral species may – through gene duplication, gene loss, lateral gene transfer (LGT), and speciation events – give rise to a gene family distributed across contemporaneous species. READ MORE
-
5. Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry
Abstract : The main contributions of this thesis are in the area of approximation and online algorithm design and derivation of lower bounds on the approximability for a number of combinatorial optimization problems with applications in computational biology and computational geometry. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. READ MORE