Imagen de Portada

Engineering faster double-array Aho-Corasick automata

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kanda, Shunsuke, Akabe, Koichi, Oda, Yusuke
Formato:	Preprint
Publicado:	2022
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

A faster algorithm for the construction of optimal factoring automata
por: Erlebach, Thomas, et al.
Publicado: (2024)

NP-Completeness for the Space-Optimality of Double-Array Tries
por: Bannai, Hideo, et al.
Publicado: (2024)

Counting perfect matchings and Hamiltonian cycles faster
por: Li, Baitian
Publicado: (2023)

A faster heuristic for the Traveling Salesman Problem with Drone
por: Hokama, Pedro H. D. B., et al.
Publicado: (2024)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
por: Fischer, David, et al.
Publicado: (2022)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
por: Kratsch, Stefan
Publicado: (2026)

Improved parallel derandomization via finite automata with applications
por: Giliberti, Jeff, et al.
Publicado: (2024)

Faster and Simpler Online Computation of String Net Frequency
por: Inenaga, Shunsuke
Publicado: (2024)

Tag arrays
por: Gagie, Travis
Publicado: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
por: Harris, David G., et al.
Publicado: (2022)

Relating Left and Right Extensions of Maximal Repeats
por: Inenaga, Shunsuke, et al.
Publicado: (2024)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
por: Kikuchi, Masaru, et al.
Publicado: (2024)

Simple Linear-time Repetition Factorization
por: Yonemoto, Yuki, et al.
Publicado: (2024)

Space-Efficient Online Computation of String Net Occurrences
por: Mieno, Takuya, et al.
Publicado: (2024)

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

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
por: Censor-Hillel, Keren, et al.
Publicado: (2025)

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

Enumerating models of DNF faster: breaking the dependency on the formula size
por: Capelli, Florent, et al.
Publicado: (2018)

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

Faster PBWT prefix-array access via batching
por: Gagie, Travis
Publicado: (2026)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
por: Mitosek, Piotr, et al.
Publicado: (2024)

Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
por: Sumiyoshi, Wataru, et al.
Publicado: (2024)

Constant sensitivity on the CDAWGs
por: Hamai, Rikuya, et al.
Publicado: (2025)

On the number of MUSs crossing a position
por: Fujimaru, Hiroto, et al.
Publicado: (2025)

Packed Acyclic Deterministic Finite Automata
por: Shibata, Hiroki, et al.
Publicado: (2024)

Tight bounds for the sensitivity of CDAWGs with left-end edits
por: Fujimaru, Hiroto, et al.
Publicado: (2023)

Faster Space-Efficient STR-IC-LCS Computation
por: Yonemoto, Yuki, et al.
Publicado: (2022)

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

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
por: Shibata, Hiroki, et al.
Publicado: (2025)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
por: Kobayashi, Yusuke, et al.
Publicado: (2024)

Subquadratic Submodular Maximization with a General Matroid Constraint
por: Kobayashi, Yusuke, et al.
Publicado: (2024)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
por: Kobayashi, Yusuke, et al.
Publicado: (2026)

FlexFlood: Efficiently Updatable Learned Multi-dimensional Index
por: Hidaka, Fuma, et al.
Publicado: (2024)

Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
por: Sato, Atsuki, et al.
Publicado: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
por: Cleary, Alan M., et al.
Publicado: (2024)

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
por: Cleary, Alan M., et al.
Publicado: (2024)

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

Edit and Alphabet-Ordering Sensitivity of Lex-parse
por: Nakashima, Yuto, et al.
Publicado: (2024)

Subsequence Matching and LCS with Segment Number Constraints
por: Yonemoto, Yuki, et al.
Publicado: (2024)