Hot sax: Efficiently finding the most unusual time series subsequence
In this work, we introduce the new problem of finding time series discords. Time series
discords are subsequences of a longer time series that are maximally different to all the rest …
discords are subsequences of a longer time series that are maximally different to all the rest …
Finding the most unusual time series subsequence: algorithms and applications
In this work we introduce the new problem of finding time series discords. Time series
discords are subsequences of longer time series that are maximally different to all the rest of …
discords are subsequences of longer time series that are maximally different to all the rest of …
Engineering synthetic TAL effectors with orthogonal target sites
The ability to engineer biological circuits that process and respond to complex cellular
signals has the potential to impact many areas of biology and medicine. Transcriptional …
signals has the potential to impact many areas of biology and medicine. Transcriptional …
On the closest string and substring problems
The problem of finding a center string that is" close" to every given string arises in
computational molecular biology and coding theory. This problem has two versions: the …
computational molecular biology and coding theory. This problem has two versions: the …
Fixed-parameter algorithms for closest string and related problems
CLOSEST STRING is one of the core problems in the field of consensus word analysis with
particular importance for computational biology. Given k strings of the same length and a …
particular importance for computational biology. Given k strings of the same length and a …
Slightly superexponential parameterized problems
A central problem in parameterized algorithms is to obtain algorithms with running time
f(k)⋅n^O(1) such that f is as slow growing a function of the parameter k as possible. In …
f(k)⋅n^O(1) such that f is as slow growing a function of the parameter k as possible. In …
Combinatorial n-fold integer programming and applications
Many fundamental NP NP-hard problems can be formulated as integer linear programs
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …
Data fusion: theory, methods, and applications
M Gagolewski - arxiv preprint arxiv:2208.01644, 2022 - arxiv.org
A proper fusion of complex data is of interest to many researchers in diverse fields, including
computational statistics, computational geometry, bioinformatics, machine learning, pattern …
computational statistics, computational geometry, bioinformatics, machine learning, pattern …
[PDF][PDF] Finding similar regions in many strings
Algorithms for finding similar, or highly conserved, regions in a group of sequences are at
the core of many molecular biology problems. We solve three main open questions in this …
the core of many molecular biology problems. We solve three main open questions in this …
Finding unusual medical time-series subsequences: Algorithms and applications
In this work, we introduce the new problem of finding time series discords. Time series
discords are subsequences of longer time series that are maximally different to all the rest of …
discords are subsequences of longer time series that are maximally different to all the rest of …