WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING
From MaRDI portal
Publication:3016225
DOI10.1142/S0129054111008490zbMath1216.68358OpenAlexW1978259858MaRDI QIDQ3016225
Liang Hu, Yi Zhang, Meng Zhang
Publication date: 14 July 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111008490
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)
Cites Work
- Ternary directed acyclic word graphs
- Substring search and repeat search using factor oracles
- Compact directed acyclic word graphs for a sliding window
- The smallest automaton recognizing the subwords of a text
- Approximate string matching using factor automata
- Fast practical multi-pattern matching
- On-line construction of compact directed acyclic word graphs
- The wide window string matching algorithm
- Transducers and repetitions
- Average sizes of suffix trees and DAWGs
- Compror: On-line lossless data compression with a factor oracle.
- On-line construction of suffix trees
- Suffix Arrays: A New Method for On-Line String Searches
- THE STRUCTURE OF FACTOR ORACLES
- Algorithms on Strings, Trees and Sequences