Search
Search Results
-
Compacting Massive Public Transport Data
In this work, we present a compact method for storing and indexing users’ trips across transport networks. This research is part of a larger project...
-
From de Bruijn Graphs to Variation Graphs – Relationships Between Pangenome Models
Pangenomes serve as a framework for joint analysis of genomes of related organisms. Several pangenome models were proposed, offering different...
-
Constant Time and Space Updates for the Sigma-Tau Problem
Sawada and Williams in [SODA 2018] and [ACM Trans. Alg. 2020] gave algorithms for constructing Hamiltonian paths and cycles in the Sigma-Tau graph,...
-
Binary Mixed-Digit Data Compression Codes
One of the most important trade-offs in data compression is between the compression ratio and decoding speed. The latter can be increased due to a...
-
Evaluating Regular Path Queries on Compressed Adjacency Matrices
Regular Path Queries (RPQs), which are essentially regular expressions to be matched against the labels of paths in labeled graphs, are at the core...
-
Sublinear Time Lempel-Ziv (LZ77) Factorization
The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that plays a central role in data compression and indexing. For a...
-
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings
We show how, given positive constants \(\epsilon \) and...
-
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
In this paper, we present the first study of the computational complexity of converting an automata-based text index structure, called the Compact...
-
Chaining of Maximal Exact Matches in Graphs
We show how to chain maximal exact matches (MEMs) between a query string Q and a labeled directed acyclic graph (DAG)...
-
Dynamic Compact Planar Embeddings
This paper presents a way to compactly represent dynamic connected planar embeddings, which may contain self loops and multi-edges, in...
-
New Advances in Rightmost Lempel-Ziv
The Lempel-Ziv (LZ) 77 factorization of a string is a widely-used algorithmic tool that plays a central role in compression and indexing. For a...
-
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
Recently, Conte et al. generalized the longest-common prefix (LCP) array from strings to Wheeler DFAs, and they showed that it can be used to...
-
Longest Common Prefix Arrays for Succinct k-Spectra
The k-spectrum of a string is the set of all distinct substrings of length k occurring in the string. K-spectra have many applications in...
-
On the Number of Factors in the LZ-End Factorization
Kreft and Navarro [DCC 2010] introduced a restricted variant of the well-known Lempel-Ziv factorization, called the LZ-End factorization. Only...
-
On Suffix Tree Detection
A suffix tree is a fundamental data structure for string processing and information retrieval, however, its structure is still not well understood....
-
Non-overlap** Indexing in BWT-Runs Bounded Space
We revisit the non-overlap** indexing problem for an efficient repetition-aware solution. The problem is to index a text T[1..n], such that...
-
Frequency-Constrained Substring Complexity
We introduce the notion of frequency-constrained substring complexity. For any finite string, it counts the distinct substrings of the string per...
-
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems
A string is called a square (resp. cube) if it is in the form of \(XX=X^2\)...
-
Largest Repetition Factorization of Fibonacci Words
A factorization of a string w is said to be a repetition factorization of w if every factor in the factorization is a repetition (i.e., the factor...
-
Compressibility Measures for Two-Dimensional Data
In this paper we extend to two-dimensional data two recently introduced one-dimensional compressibility measures: the...