Gonadotropins in the Russian Sturgeon: Their Role in Steroid Secretion and the Effect of Hormonal Treatment on Their Secretion.

In the reproduction process of male and female fish, pituitary derived gonadotropins (GTHs) play a key role. To be able to specifically investigate certain functions of Luteinizing (LH) and Follicle stimulating hormone (FSH) in Russian sturgeon (Acipenser gueldenstaedtii; st), we produced recombinant variants of the hormones using the yeast Pichia pastoris as a protein production system. We accomplished to create in vitro biologically active heterodimeric glycoproteins consisting of two associated α- and β-subunits in sufficient quantities. Three dimensional modelling of both GTHs was conducted in order to study the differences between the two GTHs. Antibodies were produced against the unique β-subunit of each of the GTHs, in order to be used for immunohistochemical analysis and to develop an ELISA for blood and pituitary hormone quantification. This detection technique revealed the specific localization of the LH and FSH cells in the sturgeon pituitary and pointed out that both cell types are present in substantially higher numbers in mature males and females, compared to immature fish. With the newly attained option to prevent cross-contamination when investigating on the effects of GTH administration, we compared the steroidogeneic response (estradiol and 11-Keto testosterone (11-KT) in female and males, respectively) of recombinant stLH, stFSH, and carp pituitary extract in male and female sturgeon gonads at different developmental stages. Finally, we injected commercially available gonadotropin releasing hormones analog (GnRH) to mature females, and found a moderate effect on the development of ovarian follicles. Application of only testosterone (T) resulted in a significant increase in circulating levels of 11-KT whereas the combination of GnRH + T did not affect steroid levels at all. The response pattern for estradiol demonstrated a similar situation. FSH levels showed significant increases when GnRH + T was administered, while no changes were present in LH levels

String Problems in the Congested Clique Model

In this paper we present algorithms for several string problems in the Congested Clique model. In the Congested Clique model, n nodes (computers) are used to solve some problem. The input to the problem is distributed among the nodes, and the communication between the nodes is conducted in rounds. In each round, every node is allowed to send an O(log n)-bit message to every other node in the network. We consider three fundamental string problems in the Congested Clique model. First, we present an O(1) rounds algorithm for string sorting that supports strings of arbitrary length. Second, we present an O(1) rounds combinatorial pattern matching algorithm. Finally, we present an O(log log n) rounds algorithm for the computation of the suffix array and the corresponding Longest Common Prefix array of a given string

Hairpin Completion Distance Lower Bound

Hairpin completion, derived from the hairpin formation observed in DNA biochemistry, is an operation applied to strings, particularly useful in DNA computing. Conceptually, a right hairpin completion operation transforms a string $S$ into $S\cdot S'$ where $S'$ is the reverse complement of a prefix of $S$. Similarly, a left hairpin completion operation transforms a string $S$ into $S'\cdot S$ where $S'$ is the reverse complement of a suffix of $S$. The hairpin completion distance from $S$ to $T$ is the minimum number of hairpin completion operations needed to transform $S$ into $T$. Recently Boneh et al. showed an $O(n^2)$ time algorithm for finding the hairpin completion distance between two strings of length at most $n$. In this paper we show that for any $\varepsilon>0$ there is no $O(n^{2-\varepsilon})$-time algorithm for the hairpin completion distance problem unless the Strong Exponential Time Hypothesis (SETH) is false. Thus, under SETH, the time complexity of the hairpin completion distance problem is quadratic, up to sub-polynomial factors.Comment: To be published in CPM 202

Hairpin Completion Distance Lower Bound

Hairpin completion, derived from the hairpin formation observed in DNA biochemistry, is an operation applied to strings, particularly useful in DNA computing. Conceptually, a right hairpin completion operation transforms a string S into S⋅ S' where S' is the reverse complement of a prefix of S. Similarly, a left hairpin completion operation transforms a string S into S'⋅ S where S' is the reverse complement of a suffix of S. The hairpin completion distance from S to T is the minimum number of hairpin completion operations needed to transform S into T. Recently Boneh et al. [Itai Boneh et al., 2023] showed an O(n²) time algorithm for finding the hairpin completion distance between two strings of length at most n. In this paper we show that for any ε > 0 there is no O(n^{2-ε})-time algorithm for the hairpin completion distance problem unless the Strong Exponential Time Hypothesis (SETH) is false. Thus, under SETH, the time complexity of the hairpin completion distance problem is quadratic, up to sub-polynomial factors

Searching 2D-Strings for Matching Frames

We study a natural type of repetitions in 2-dimensional strings. Such a repetition, called a matching frame, is a rectangular substring of size at least 2× 2 with equal marginal rows and equal marginal columns. Matching frames first appeared in literature in the context of Wang tiles. We present two algorithms finding a matching frame with the maximum perimeter in a given n× m input string. The first algorithm solves the problem exactly in Õ(n^{2.5}) time (assuming n ≥ m). The second algorithm finds a (1-ε)-approximate solution in Õ((nm)/ε⁴) time, which is near linear in the size of the input for constant ε. In particular, by setting ε = O(1) the second algorithm decides the existence of a matching frame in a given string in Õ(nm) time. Some technical elements and structural properties used in these algorithms can be of independent interest

Searching 2D-Strings for Matching Frames

We introduce the natural notion of a matching frame in a $2$-dimensional string. A matching frame in a $2$-dimensional $n\times m$ string $M$, is a rectangle such that the strings written on the horizontal sides of the rectangle are identical, and so are the strings written on the vertical sides of the rectangle. Formally, a matching frame in $M$ is a tuple $(u,d,\ell,r)$ such that $M[u][\ell ..r] = M[d][\ell ..r]$ and $M[u..d][\ell] = M[u..d][r]$. In this paper, we present an algorithm for finding the maximum perimeter matching frame in a matrix $M$ in $\tilde{O}(n^{2.5})$ time (assuming $n \ge m)$. Additionally, for every constant $\epsilon> 0$ we present a near-linear $(1-\epsilon)$-approximation algorithm for the maximum perimeter of a matching frame. In the development of the aforementioned algorithms, we introduce inventive technical elements and uncover distinctive structural properties that we believe will captivate the curiosity of the community

Time-Space Tradeoffs for Finding a Long Common Substring

We consider the problem of finding, given two documents of total length $n$, a longest string occurring as a substring of both documents. This problem, known as the Longest Common Substring (LCS) problem, has a classic $O(n)$-time solution dating back to the discovery of suffix trees (Weiner, 1973) and their efficient construction for integer alphabets (Farach-Colton, 1997). However, these solutions require $\Theta(n)$ space, which is prohibitive in many applications. To address this issue, Starikovskaya and Vildh{\o}j (CPM 2013) showed that for $n^{2/3} \le s \le n^{1-o(1)}$, the LCS problem can be solved in $O(s)$ space and $O(\frac{n^2}{s})$ time. Kociumaka et al. (ESA 2014) generalized this tradeoff to $1 \leq s \leq n$, thus providing a smooth time-space tradeoff from constant to linear space. In this paper, we obtain a significant speed-up for instances where the length $L$ of the sought LCS is large. For $1 \leq s \leq n$, we show that the LCS problem can be solved in $O(s)$ space and $\tilde{O}(\frac{n^2}{L\cdot s}+n)$ time. The result is based on techniques originating from the LCS with Mismatches problem (Flouri et al., 2015; Charalampopoulos et al., CPM 2018), on space-efficient locally consistent parsing (Birenzwige et al., SODA 2020), and on the structure of maximal repetitions (runs) in the input documents

A Novel Model for Development, Organization, and Function of Gonadotropes in Fish Pituitary

The gonadotropins follicle-stimulating hormone (FSH) and luteinizing hormone (LH) are key regulators of the reproductive axis in vertebrates. Despite the high popularity of zebrafish as a model organism for studying reproductive functions, to date no transgenic zebrafish with labeled gonadotropes have been introduced. Using gonadotropin regulatory elements from tilapia, we generated two transgenic zebrafish lines with labeled gonadotropes. The tilapia and zebrafish regulatory sequences were highly divergent but several conserved elements allowed the tilapia promoters to correctly drive the transgenes in zebrafish pituitaries. FSH cells reacted to stimulation with GnRH by proliferating and showing increased transgene fluorescence, whereas estrogen exposure caused a decrease in cell number and transgene fluorescence. Transgene fluorescence reflected the expression pattern of the endogenous fshb gene. Ontogenetic expression of the transgenes followed typical patterns, with FSH cells appearing early in development, and LH cells appearing later and increasing dramatically in number with the onset of puberty. Our transgenic lines provide a powerful tool for investigating the development, anatomy and function of the reproductive axis in lower vertebrates