48 research outputs found
Primary hyperparathyroidism
Primary hyperparathyroidism is an endocrine disorder that results in overproduction of parathyroid hormone by overactivated parathyroid gland leading to a significant rise in blood serum calcium. It results in hypercalcaemia, which has a significant impact mainly on the kidneys and bones and results in a variety of signs and symptoms. Primary hyperparathyroidism should be treated because, if left without any therapy, it can lead even to death. Surgery is considered as the best and only successful therapy, with very low risk of recurrence and relatively low complication rate. The aim of this review is to present clinical basis, aetiology, diagnostic possibilities, and treatment opportunities
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
In this paper, a compressed membership problem for finite automata, both
deterministic and non-deterministic, with compressed transition labels is
studied. The compression is represented by straight-line programs (SLPs), i.e.
context-free grammars generating exactly one string. A novel technique of
dealing with SLPs is introduced: the SLPs are recompressed, so that substrings
of the input text are encoded in SLPs labelling the transitions of the NFA
(DFA) in the same way, as in the SLP representing the input text. To this end,
the SLPs are locally decompressed and then recompressed in a uniform way.
Furthermore, such recompression induces only small changes in the automaton, in
particular, the size of the automaton remains polynomial.
Using this technique it is shown that the compressed membership for NFA with
compressed labels is in NP, thus confirming the conjecture of Plandowski and
Rytter and extending the partial result of Lohrey and Mathissen; as it is
already known, that this problem is NP-hard, we settle its exact computational
complexity. Moreover, the same technique applied to the compressed membership
for DFA with compressed labels yields that this problem is in P; for this
problem, only trivial upper-bound PSPACE was known
On Maximal Unbordered Factors
Given a string of length , its maximal unbordered factor is the
longest factor which does not have a border. In this work we investigate the
relationship between and the length of the maximal unbordered factor of
. We prove that for the alphabet of size the expected length
of the maximal unbordered factor of a string of length~ is at least
(for sufficiently large values of ). As an application of this result, we
propose a new algorithm for computing the maximal unbordered factor of a
string.Comment: Accepted to the 26th Annual Symposium on Combinatorial Pattern
Matching (CPM 2015
Prognostic value of the time interval between surgery and adjuvant radiotherapy in patients treated for early stage invasive cervical cancer
Queries on LZ-Bounded Encodings
We describe a data structure that stores a string in space similar to
that of its Lempel-Ziv encoding and efficiently supports access, rank and
select queries. These queries are fundamental for implementing succinct and
compressed data structures, such as compressed trees and graphs. We show that
our data structure can be built in a scalable manner and is both small and fast
in practice compared to other data structures supporting such queries
Synchronization Problems in Automata without Non-trivial Cycles
We study the computational complexity of various problems related to
synchronization of weakly acyclic automata, a subclass of widely studied
aperiodic automata. We provide upper and lower bounds on the length of a
shortest word synchronizing a weakly acyclic automaton or, more generally, a
subset of its states, and show that the problem of approximating this length is
hard. We investigate the complexity of finding a synchronizing set of states of
maximum size. We also show inapproximability of the problem of computing the
rank of a subset of states in a binary weakly acyclic automaton and prove that
several problems related to recognizing a synchronizing subset of states in
such automata are NP-complete.Comment: Extended and corrected version, including arXiv:1608.00889.
Conference version was published at CIAA 2017, LNCS vol. 10329, pages
188-200, 201
Detecting One-variable Patterns
Given a pattern such that
, where is a
variable and its reversal, and
are strings that contain no variables, we describe an
algorithm that constructs in time a compact representation of all
instances of in an input string of length over a polynomially bounded
integer alphabet, so that one can report those instances in time.Comment: 16 pages (+13 pages of Appendix), 4 figures, accepted to SPIRE 201
Block trees
Let string S[1..n] be parsed into z phrases by the Lempel-Ziv algorithm. The corresponding compression algorithm encodes S in O(z) space, but it does not support random access to S. We introduce a data structure, the block tree, that represents S in O(z log(n/z)) space and extracts any symbol of S in time O(log(n/z)), among other space-time tradeoffs. The structure also supports other queries that are useful for building compressed data structures on top of S. Further, block trees can be built in linear time and in a scalable manner. Our experiments show that block trees offer relevant space-time tradeoffs compared to other compressed string representations for highly repetitive strings. (C) 2020 Elsevier Inc. All rights reserved.Peer reviewe
Forward Analysis and Model Checking for Trace Bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the
bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete
deterministic ones, which we claim provide an adequate basis for the study of
forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth.
Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered
previously for the termination of forward analysis, boundedness is decidable.
Boundedness turns out to be a valuable restriction for WSTS verification, as we
show that it further allows to decide all -regular properties on the
set of infinite traces of the system