Hae
Aineistot 11-20 / 71
Around the Domino Problem – Combinatorial Structures and Algebraic Tools
(Turku Centre for Computer Science, 2020-07-15)
Given a finite set of square tiles, the domino problem is the question of whether is it possible to tile the plane using these tiles. This problem is known to be undecidable in the planar case, and is strongly linked to ...
Extracting information from high-throughput gene expression data with pathway analysis and deconvolution
(Turun yliopisto, 2022-05-06)
Modern technologies allow for the collection of large biological datasets that can be utilised for diverse health-related applications. However, to extract useful information from such data, computational methods are needed. ...
An Algebraic Approach to Nivat's Conjecture
(Turku Centre for Computer Science, 2018-08-17)
This thesis introduces a new, algebraic method to study multidimensional configurations, also sometimes called words, which have low pattern complexity. This is the setting of several open problems, most notably Nivat’s ...
Adaptive Dynamics of Resource Specialization
(Turun yliopistoAnnales Universitatis Turkuensis A I 508, 2015-03-13)
Ecological specialization in resource utilization has various facades ranging from nutritional resources via host use of parasites or phytophagous insects to local adaptation in different habitats. Therefore, the evolution ...
Statistical Methods for Conservation and Alignment Quality in Proteins
(Turun yliopistoAnnales Universitatis Turkuensis AII 228, 2008-11-07)
Construction of multiple sequence alignments is a fundamental task in Bioinformatics. Multiple sequence alignments are used as a prerequisite in many Bioinformatics methods, and subsequently the quality of such methods can ...
On using distances to locate vertices: resolving sets and metric bases of graphs, two generalisations and their forced vertices
(Turun yliopisto, 2021-06-18)
A graph consists of vertices that are connected by edges. A resolving set of a graph is a subset of its vertices that gives a unique combination of distances to every vertex of the graph. We can use the distances we are ...
Regularity of minimizers and solutions with generalized Orlicz growth
(Turun yliopisto, 2020-11-21)
This thesis studies properties of minimizers of variational integrals and solutions of partial differential equations with generalized Orlicz growth (also known as Musielak– Orlicz growth). This is continuation of regularity ...
Subshifts with Simple Cellular Automata
(Turku Centre for Computer Science, 2014-06-28)
A subshift is a set of infinite one- or two-way sequences over a fixed finite set, defined by a set of forbidden patterns. In this thesis, we study subshifts in the topological setting, where the natural morphisms between ...
Qualitative Characteristics and Quantitative Measures of Solution's Reliability in Discrete Optimization: Traditional Analytical Approaches, Innovative Computational Methods and Applicability
(Turun yliopistoAnnales Universitatis Turkuensis A I 451, 2012-12-18)
The purpose of this thesis is twofold. The first and major part is devoted to
sensitivity analysis of various discrete optimization problems while the second
part addresses methods applied for calculating measures of ...
Generalized Orlicz spaces and partial differential equations with application to image restoration
(Turun yliopisto, 2022-11-11)
The research area of this thesis is nonlinear functional analysis, a branch of Mathematics which examines questions related to qualitative aspects of solution of a differential equation, such as existence, uniqueness, ...








