Inferring strings from position heaps in linear time
From MaRDI portal
Publication:6091154
DOI10.1007/978-3-031-27051-2_11arXiv2209.12405MaRDI QIDQ6091154
Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Koshiro Kumagai
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.12405
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line construction of position heaps
- Reverse engineering of compact suffix trees and links: a novel algorithm
- Inferring strings from suffix trees and links on a binary alphabet
- Position heaps: a simple and dynamic text indexing data structure
- The smallest automaton recognizing the subwords of a text
- Eulerian graphs and related topics. Part 1, Volume 1
- A suffix tree or not a suffix tree?
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Efficient validation and construction of border arrays and validation of string matching automata
- Fast Pattern Matching in Strings
- Finding All Spanning Trees of Directed and Undirected Graphs
- Algorithms on Strings, Trees and Sequences
- Words over an ordered alphabet and suffix permutations
- String Inference from Longest-Common-Prefix Array
- Complete inverted files for efficient text retrieval and analysis
- REVERSE ENGINEERING PREFIX TABLES
- Mathematical Foundations of Computer Science 2003
This page was built for publication: Inferring strings from position heaps in linear time
