Cover Image

Merging RLBWTs adaptively

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gagie, Travis
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Worst-case optimal adaptive alphabetic prefix-free coding
by: Gagie, Travis
Published: (2021)

r*-indexing
by: Gagie, Travis
Published: (2025)

Tag arrays
by: Gagie, Travis
Published: (2024)

How to Find Long Maximal Exact Matches and Ignore Short Ones
by: Gagie, Travis
Published: (2024)

Faster PBWT prefix-array access via batching
by: Gagie, Travis
Published: (2026)

Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)

Ruler Rolling
by: Lyu, Xing, et al.
Published: (2022)

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

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

Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)

MIOV: Reordering MOVI for even better locality
by: Perešíni, Peter, et al.
Published: (2024)

Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023)

Faster run-length compressed suffix arrays
by: Brown, Nathaniel K., et al.
Published: (2024)

Incongruity-sensitive access to highly compressed strings
by: Cicalese, Ferdinando, et al.
Published: (2026)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)

The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025)

Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)

Prefix-free parsing for merging big BWTs
by: Diaz-Dominguez, Diego, et al.
Published: (2025)

KeBaB: $k$-mer based breaking for finding long MEMs
by: Brown, Nathaniel K., et al.
Published: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)

Three Algorithms for Merging Hierarchical Navigable Small World Graphs
by: Ponomarenko, Alexander
Published: (2025)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
by: Sun, Ming, et al.
Published: (2022)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
by: Joshi, Amit
Published: (2025)

The adaptive complexity of parallelized log-concave sampling
by: Zhou, Huanjian, et al.
Published: (2024)

Lower Bounds for Non-adaptive Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2025)

ShiftDTW: adapting the DTW metric for cyclic time series clustering
by: Foulon, Lucas, et al.
Published: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
by: Hu, Jialu, et al.
Published: (2024)

Variants of Merge-Width and Applications
by: Drabik, Karolina, et al.
Published: (2026)

Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev's Sorting Networks as Base Cases
by: Aly, Anas Gamal, et al.
Published: (2025)

Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
by: P V, Althaf, et al.
Published: (2026)

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
by: Carbonell, Juan Pablo, et al.
Published: (2025)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
by: Song, Shihong, et al.
Published: (2024)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
by: Qin, Hao, et al.
Published: (2025)

A Hybrid Vectorized Merge Sort on ARM NEON
by: Zhou, Jincheng, et al.
Published: (2024)

Fast and Efficient Merge of Sorted Input Lists in Hardware Using List Offset Merge Sorters
by: Kent, Robert B., et al.
Published: (2025)

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
by: Chambers, Erin Wolf, et al.
Published: (2024)

Tight Bounds for Sampling q-Colorings via Coupling from the Past
by: Ding, Tianxing, et al.
Published: (2025)