Hae
Aineistot 1-10 / 70
On the k-Abelian Equivalence Relation of Finite Words
(Turku Centre for Computer Science, 2019-06-28)
This thesis is devoted to the so-called k-abelian equivalence relation of sequences of symbols, that is, words. This equivalence relation is a generalization of the abelian equivalence of words. Two words are abelian ...
Applications in bioinformatics with Markov models
(Turun yliopisto, 2018-06-01)
In this thesis we present four applications in bioinformatics with Markov models. That is, we extend the use of such models in the mathematical and statistical analysis of biological data. The data we consider are drawn ...
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 ...
Hyperbolic type metrics in geometric function theory
(Turun yliopisto, 2018-03-17)
The research area of this thesis is Geometric Function Theory, which is a subfield of mathematical analysis. The thesis consists of four published papers. Prepublication versions of these papers are available on the www-pages ...
Statistical methods for the analysis of high-content organotypic cancer cell culture imaging data
(Turun yliopisto, 2018-03-03)
Organotypic cancer cell cultures combined with modern imaging technology have greatly expanded the possibilities of in vitro cancer research and drug development. In fact, imaging and subsequent image analyses have become ...
Modeling and prediction of advanced prostate cancer
(Turun yliopisto, 2018-11-16)
Background: Prostate cancer (PCa) is the most commonly diagnosed cancer and second leading cause of cancer-related deaths for men in Western countries. The advanced form of the disease is life-threatening with few options ...
On some one-sided dynamics of cellular automata
(Turku Centre for Computer Science, 2020-09-04)
A dynamical system consists of a space of all possible world states and a transformation of said space. Cellular automata are dynamical systems where the space is a set of one- or two-way infinite symbol sequences and the ...
On Independent Component Analysis and Supervised Dimension Reduction for Time Series
(Turun yliopisto, 2018-02-02)
The main goal of this thesis work has been to develop tools to recover hidden structures, latent variables, or latent subspaces for multivariate and dependent time series data. The secondary goal has been to write ...
Bundle methods in nonsmooth DC optimization
(Turun yliopisto, 2018-06-21)
Due to the complexity of many practical applications, we encounter optimization problems with nonsmooth functions, that is, functions which are not continuously differentiable everywhere. Classical gradient-based methods ...
Cellular automata with complicated dynamics
(Turun yliopisto, 2019-12-13)
A subshift is a collection of bi-infinite sequences (configurations) of symbols where some finite patterns of symbols are forbidden to occur. A cellular automaton is a transformation that changes each configuration of a ...