Imagen de Portada

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Olbrich, Jannik
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

BWT for string collections
por: Cenzato, Davide, et al.
Publicado: (2025)

Bijective BWT based compression schemes
por: Badkobeh, Golnaz, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Fast Similarity Sketching
por: Dahlgaard, Søren, et al.
Publicado: (2017)

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

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

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

Fast Pattern Matching with Epsilon Transitions
por: Cotumaccio, Nicola
Publicado: (2025)

Fast and simple unrooted dynamic forests
por: Berendsohn, Benjamin Aram
Publicado: (2023)

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

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

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

Fast Schulze Voting Using Quickselect
por: Arora, Arushi, et al.
Publicado: (2024)

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

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

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

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

Noisy (Binary) Searching: Simple, Fast and Correct
por: Dereniowski, Dariusz, et al.
Publicado: (2021)

Fast and Practical Single-Exponential Algorithms for Branchwidth
por: Kaneda, Taiki, et al.
Publicado: (2026)

Fast Practical Compression of Deterministic Finite Automata
por: Bille, Philip, et al.
Publicado: (2023)