Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Daykin, Jacqueline W."'
We say that a family $\mathcal{W}$ of strings over $\Sigma^+$ forms a Unique Maximal Factorization Family (UMFF) if and only if every $w \in \mathcal{W}$ has a unique maximal factorization. Further, an UMFF $\mathcal{W}$ is called a circ-UMFF wheneve
Externí odkaz:
http://arxiv.org/abs/2409.02757
Autor:
Major, Lily, Davies, Dave, Clare, Amanda, Daykin, Jacqueline W., Mora, Benjamin, Zarges, Christine
The Burrows-Wheeler Transform (BWT) is an efficient invertible text transformation algorithm with the properties of tending to group identical characters together in a run, and enabling search of the text. This transformation has extensive uses parti
Externí odkaz:
http://arxiv.org/abs/2402.17005
The Burrows-Wheeler Transform (BWT) is a string transformation technique widely used in areas such as bioinformatics and file compression. Many applications combine a run-length encoding (RLE) with the BWT in a way which preserves the ability to quer
Externí odkaz:
http://arxiv.org/abs/2401.16435
Publikováno v:
In Discrete Applied Mathematics 15 October 2024 355:180-199
We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries of the permutation have the same difference modulo the respective stri
Externí odkaz:
http://arxiv.org/abs/2107.02503
Autor:
Clare, Amanda, Daykin, Jacqueline W.
In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy-type algorithm which produces Lyndon factorizations with small numbers of factors along with a modification for large numbers of factors
Externí odkaz:
http://arxiv.org/abs/1806.05942
Autor:
Daykin, Jacqueline W., Groult, Richard, Guesnet, Yannick, Lecroq, Thierry, Lefebvre, Arnaud, Léonard, Martine, Mouchard, Laurent, Prieur-Gaston, Élise, Watson, Bruce
A degenerate or indeterminate string on an alphabet $\Sigma$ is a sequence of non-empty subsets of $\Sigma$. Given a degenerate string $t$ of length $n$, we present a new method based on the Burrows--Wheeler transform for searching for a degenerate p
Externí odkaz:
http://arxiv.org/abs/1708.01130
$V$-order is a global order on strings related to Unique Maximal Factorization Families (UMFFs), which are themselves generalizations of Lyndon words. $V$-order has recently been proposed as an alternative to lexicographical order in the computation
Externí odkaz:
http://arxiv.org/abs/1507.07038
We consider the problem of finding repetitive structures and inherent patterns in a given string $\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\s{u}$ of a string $\s{s}$ is both a prefix and a suffix of $\s{s}$ such that $\s
Externí odkaz:
http://arxiv.org/abs/1506.06983
Publikováno v:
In Discrete Applied Mathematics 31 December 2016 215:41-46