:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Olbrich, Jannik
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2504.19123
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

In-Place BWT and Lyndon Array Construction in Constant Space
by: Louza, Felipe A., et al.
Published: (2025)

The TAG array of a multiple sequence alignment
by: Olbrich, Jannik, et al.
Published: (2025)

Hardness Results on Characteristics for Elastic-Degenerated Strings
by: Köppl, Dominik, et al.
Published: (2024)

BWT for string collections
by: Cenzato, Davide, et al.
Published: (2025)

Bijective BWT based compression schemes
by: Badkobeh, Golnaz, et al.
Published: (2024)

Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
by: Diaz-Dominguez, Diego
Published: (2024)

A survey of BWT variants for string collections
by: Cenzato, Davide, et al.
Published: (2022)

Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
Published: (2026)

V-Words, Lyndon Words and Galois Words
by: Daykin, Jacqueline W., et al.
Published: (2024)

On the sensitivity of CDAWG-grammars
by: Fujimaru, Hiroto, et al.
Published: (2025)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
by: Sanaullah, Ahsan, et al.
Published: (2025)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
by: Klimm, Max, et al.
Published: (2026)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
by: Komusiewicz, Christian, et al.
Published: (2023)

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
by: Holtgrefe, Niels, et al.
Published: (2026)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
by: Jones, Mark, et al.
Published: (2025)

Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
by: Moreno, Matthew Andres, et al.
Published: (2024)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
by: Negri, Pietro, et al.
Published: (2026)

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
by: van Iersel, Leo, et al.
Published: (2026)

Fast and Faithful Edge Bundling using Spectral Sparsification
by: Jiang, Xingjue, et al.
Published: (2026)

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
by: Holtgrefe, Niels, et al.
Published: (2026)

Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)

A computational study of Gomory-Hu construction tree algorithms
by: Kolmogorov, Vladimir
Published: (2022)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)

Fast In-Spectrum Graph Watermarks
by: Bourrée, Jade Garcia, et al.
Published: (2025)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

Fast Pattern Matching with Epsilon Transitions
by: Cotumaccio, Nicola
Published: (2025)

Fast and simple unrooted dynamic forests
by: Berendsohn, Benjamin Aram
Published: (2023)

Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)

Fast decremental tree sums in forests
by: Berendsohn, Benjamin Aram, et al.
Published: (2026)

Fast and Small Subsampled R-indexes
by: Cobas, Dustin, et al.
Published: (2024)

Fast Schulze Voting Using Quickselect
by: Arora, Arushi, et al.
Published: (2024)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

Round-efficient Fully-scalable MPC algorithms for k-Means
by: Jiang, Shaofeng H. -C., et al.
Published: (2026)

Computing the LZ-End parsing: Easy to implement and practically efficient
by: Dinklage, Patrick
Published: (2024)

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)

Fast Algorithms for Graph Arboricity and Related Problems
by: Cen, Ruoxu, et al.
Published: (2025)

Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)

Provably Fast and Space-Efficient Parallel Biconnectivity
by: Dong, Xiaojun, et al.
Published: (2023)