Related papers: In-Place Bijective Burrows-Wheeler Transforms
Wavelets have emerged as a cutting edge technology in a number of fields. Concrete results of their application in Image and Signal processing suggest that wavelets can be effectively applied to Natural Language Processing (NLP) tasks that…
Some recent results have introduced external-memory algorithms to compute self-indexes of a set of strings, mainly via computing the Burrows-Wheeler Transform (BWT) of the input strings. The motivations for those results stem from…
Indexing highly repetitive texts - such as genomic databases, software repositories and versioned text collections - has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts…
We give an approach for relative and degenerate Gromov--Witten invariants, inspired by that of Jun Li but replacing predeformable maps by transversal maps to a twisted target. The main advantage is a significant simplification in the…
Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…
We assume the permutation $\pi$ is given by an $n$-element array in which the $i$-th element denotes the value $\pi(i)$. Constructing its inverse in-place (i.e. using $O(\log{n})$ bits of additional memory) can be achieved in linear time…
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…
In this paper, we have studied continuous fractional wavelet transform (CFrWT) in $n$-dimensional Euclidean space $\mathbb{R}^n$ with dilation parameter $\boldsymbol a=(a_{1},a_{2},\ldots,a_{n}),$ such that none of $a_{i}'s$ are zero.…
The dual-tree complex wavelet transform (DT-$\mathbb{C}$WT) is extended to the 4D setting. Key properties of 4D DT-$\mathbb{C}$WT, such as directional sensitivity and shift-invariance, are discussed and illustrated in a tomographic…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We consider a multitype Galton-Watson process that allows for the mutation and reversion of individual types in discrete and continuous time. In this setting, we explicitly compute the time evolution of quantities such as the mean and…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow…
An inductive learning algorithm takes a set of data as input and generates a hypothesis as output. A set of data is typically consistent with an infinite number of hypotheses; therefore, there must be factors other than the data that…
We apply the BFFT formalism to a prototypical second-class system, aiming to convert its constraints from second- to first-class. The proposed system admits a consistent initial set of second-class constraints and an open potential function…
Given a bivariate weight function defined on the positive quadrant of $\mathbb{R}^2$, we study polynomials in two variables orthogonal with respect to varying measures obtained by special modifications of this weight function. In…
Wavelet transforms, a powerful mathematical tool, have been widely used in different domains, including Signal and Image processing, to unravel intricate patterns, enhance data representation, and extract meaningful features from data.…
Enumerating characteristic substrings (e.g., maximal repeats, minimal unique substrings, and minimal absent words) in a given string has been an important research topic because there are a wide variety of applications in various areas such…
We define generalized de Bruijn words as those words having a Burrows-Wheeler transform that is a concatenation of permutations of the alphabet. We show that generalized de Bruijn words are in 1-to-1 correspondence with Hamiltonian cycles…
Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi Theorem which characterises PTIME (over ordered structures)…