Cover Image

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lecroq, Thierry
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms E.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive encodings for small and fast compressed suffix arrays
by: Díaz-Domínguez, Diego, et al.
Published: (2026)

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

Efficient Computation of Periods and Covers Using Sampling
by: Lecroq, Thierry, et al.
Published: (2024)

Approximate Cartesian Tree Matching: an Approach Using Swaps
by: Auvray, Bastien, et al.
Published: (2023)

Cartesian Forest Matching
by: Auvray, Bastien, et al.
Published: (2025)

Optimal prefix-suffix queries with applications
by: Pissis, Solon P.
Published: (2024)

Highway Preferential Attachment Models for Geographic Routing
by: Gila, Ofek, et al.
Published: (2024)

MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
by: Hermann, Stefan
Published: (2025)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
by: Gila, Ofek, et al.
Published: (2023)

Cache-Oblivious Representation of B-Tree Structures
by: Ondráček, Lukáš, et al.
Published: (2022)

Fast Geographic Routing in Fixed-Growth Graphs
by: Gila, Ofek, et al.
Published: (2025)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
by: Masson, Charles, et al.
Published: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
by: Agarwala, Aryan, et al.
Published: (2024)

Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data
by: Laso, Ruben, et al.
Published: (2025)

Approximate Cartesian Tree Matching with One Difference
by: Auvray, Bastien, et al.
Published: (2025)

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
by: Krawczyk, Tomasz
Published: (2024)

Sampling Space-Saving Set Sketches
by: Lee, Homin K., et al.
Published: (2024)

Faster Linear-Space Data Structures for Path Frequency Queries
by: Rata, Ovidiu
Published: (2026)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
by: Liu, Junfeng, et al.
Published: (2025)

Space/time-efficient RDF stores based on circular suffix sorting
by: Brisaboa, Nieves R., et al.
Published: (2020)

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
by: Krawczyk, Tomasz
Published: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
by: Crochemore, Maxime, et al.
Published: (2025)

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
by: Koch, Stefan, et al.
Published: (2025)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

A customizable inexact subgraph matching algorithm for attributed graphs
by: Benko, Tatyana, et al.
Published: (2025)

A Computational Proof of the Highest-Scoring Boggle Board
by: Vanderkam, Dan
Published: (2025)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
by: Garg, Ishant
Published: (2026)

Optimal Preprocessing for Answering On-Line Product Queries
by: Alon, Noga, et al.
Published: (2024)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
by: Brodal, Gerth Stølting
Published: (2024)

The Merkle Mountain Belt
by: Cevallos, Alfonso, et al.
Published: (2025)

New Entropy Measures for Tries with Applications to the XBWT
by: Carfagna, Lorenzo, et al.
Published: (2025)

New simple and fast quicksort algorithm for equal keys
by: Afereidoon, Parviz
Published: (2025)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
by: Rajabi-Alni, Fatemeh, et al.
Published: (2014)

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

Techniques for Authenticating Quantile Digests
by: Scala, Alessandro
Published: (2024)

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

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

How fast can you find a good hypothesis?
by: Aamand, Anders, et al.
Published: (2025)

Lawler-Moore Speedups via Additive Combinatorics
by: Bringmann, Karl, et al.
Published: (2026)