Image de couverture de livre

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sanaullah, Ahsan, Zhi, Degui, Zhang, Shaojie
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal-Time Move Structure Construction
par: Brown, Nathaniel K., et autres
Publié: (2026)

Compressed Dictionary Matching on Run-Length Encoded Strings
par: Bille, Philip, et autres
Publié: (2025)

Faster Iterative $ϕ$ Queries on the Positional BWT
par: Bonizzoni, Paola, et autres
Publié: (2026)

Optimal-Time Mapping in Run-Length Compressed PBWT
par: Bonizzoni, Paola, et autres
Publié: (2026)

BWT for string collections
par: Cenzato, Davide, et autres
Publié: (2025)

Bijective BWT based compression schemes
par: Badkobeh, Golnaz, et autres
Publié: (2024)

Counting on General Run-Length Grammars
par: Navarro, Gonzalo, et autres
Publié: (2024)

A survey of BWT variants for string collections
par: Cenzato, Davide, et autres
Publié: (2022)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
par: Duyster, Anouk, et autres
Publié: (2025)

In-Place BWT and Lyndon Array Construction in Constant Space
par: Louza, Felipe A., et autres
Publié: (2025)

Longest Unbordered Factors on Run-Length Encoded Strings
par: Sekizaki, Shoma, et autres
Publié: (2025)

Towards Efficient Data Structures for Approximate Search with Range Queries
par: Kian, Ladan, et autres
Publié: (2026)

New Structures and Algorithms for Length-Constrained Expander Decompositions
par: Haeupler, Bernhard, et autres
Publié: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2026)

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
par: Olbrich, Jannik
Publié: (2025)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
par: Kempa, Dominik, et autres
Publié: (2023)

Cut-Query Algorithms with Few Rounds
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Tight Lower Bounds for Central String Queries in Compressed Space
par: Kempa, Dominik, et autres
Publié: (2025)

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
par: Jo, Seungbum, et autres
Publié: (2022)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
par: Azarmehr, Amir, et autres
Publié: (2025)

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
par: Ferragina, Paolo, et autres
Publié: (2025)

The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
par: Cleary, Alan M., et autres
Publié: (2024)

Quantum Data Structure for Range Minimum Query
par: Wang, Qisheng, et autres
Publié: (2026)

Simpler O(1) Query Algorithm for Level Ancestors
par: Saxena, Sanjeev
Publié: (2022)

Semi-Streaming Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2025)

Engineering Hypergraph $b$-Matching Algorithms
par: Großmann, Ernestine, et autres
Publié: (2024)

Algorithms for Parameterized String Matching with Mismatches
par: Saha, Apurba, et autres
Publié: (2024)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
par: Liang, Wei, et autres
Publié: (2024)

Algorithms for Optimizing Acyclic Queries
par: Luo, Zheng, et autres
Publié: (2025)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
par: Bernstein, Aaron, et autres
Publié: (2024)

Algorithms for Efficient, Compact Online Data Stream Curation
par: Moreno, Matthew Andres, et autres
Publié: (2024)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
par: Shah, Vihan
Publié: (2026)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
par: Gomes, Guilherme C. M., et autres
Publié: (2024)

Efficient Trace Frequency Queries in Sparse Graphs
par: Awofeso, Christine, et autres
Publié: (2025)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

Fast and Efficient Matching Algorithm with Deadline Instances
par: Song, Zhao, et autres
Publié: (2023)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
par: Ganczorz, Adam, et autres
Publié: (2025)

Enumeration Algorithms for Conjunctive Queries with Projection
par: Deep, Shaleen, et autres
Publié: (2021)