Computing DAWGs and minimal absent words in linear time for integer alphabets
From MaRDI portal
Publication:4608599
DOI10.4230/LIPICS.MFCS.2016.38zbMATH Open1398.68703WikidataQ90410044 ScholiaQ90410044MaRDI QIDQ4608599FDOQ4608599
Authors: Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda 
Publication date: 21 March 2018
Recommendations
Cited In (17)
- Online algorithms for constructing linear-size suffix trie
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
- Absent words in a sliding window with applications
- Absent subsequences in words
- Title not available (Why is that?)
- Truncated DAWGs and their application to minimal absent word problem
- Linear time online algorithms for constructing linear-size suffix trie
- Reverse-safe text indexing
- Absent Subsequences in Words
- Combinatorics of minimal absent words for a sliding window
- Constructing antidictionaries of long texts in output-sensitive space
- Internal shortest absent word queries in constant time and linear space
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- Palindromic trees for a sliding window and its applications
- Minimal absent words in rooted and unrooted trees
- Title not available (Why is that?)
- Linear-time computation of generalized minimal absent words for multiple strings
This page was built for publication: Computing DAWGs and minimal absent words in linear time for integer alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608599)
