Pages that link to "Item:Q1764897"
From MaRDI portal
The following pages link to On-line construction of compact directed acyclic word graphs (Q1764897):
Displaying 14 items.
- Linear-size suffix tries (Q294967) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- On Sturmian graphs (Q881581) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- On the Suffix Automaton with Mismatches (Q3503902) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- The palindromization map (Q6048431) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
