Search for dissertations about: "folding complexity"
Showing result 1 - 5 of 18 swedish dissertations containing the words folding complexity.
-
1. The birth and growth of the protein folding nucleus : Studies of protein folding focused on critical contacts, topology and ionic interactions
Abstract : Proteins are among the most complex molecules in the cell and they play a major role in life itself. The complexity is not restricted to just structure and function, but also embraces the protein folding reaction. READ MORE
-
2. Post-synaptic Density Disc Large Zo-1 (PDZ) Domains : From Folding and Binding to Drug Targeting
Abstract : Understanding how proteins fold and bind is interesting since these processes are central to most biological activity. Protein folding and protein-protein interaction are by themselves very complex but using a good and robust system to study them could ease some of the hurdles. READ MORE
-
3. On the Size and Shape of Polymers and Polymer Complexes : A Computational and Light Scattering Study
Abstract : Detailed characterization of size and shape of polymers, and development of methods to elucidate the mechanisms behind shape transitions are central issues in this thesis. In particular we characterize grafted polymer chains under confinement in terms of the chain entanglement complexity and mean molecular size. READ MORE
-
4. Contributions to low-complexity digital filters
Abstract : In this thesis we discuss design and implementation of low-complexity digital filters. Digital filters are key components in many digital signal processing (DSP) systems. Typical applications include interpolation, decimation, and noise suppression.The work presented in the thesis can be divided into four parts. READ MORE
-
5. Exact and approximation algorithms for graph problems with some biological applications
Abstract : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. READ MORE