Pages that link to "Item:Q1401392"
From MaRDI portal
The following pages link to Truncated suffix trees and their application to data compression. (Q1401392):
Displaying 15 items.
- A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
- Compact directed acyclic word graphs for a sliding window (Q876704) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Dictionary matching with a few gaps (Q2346375) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Irredundant tandem motifs (Q2437750) (← links)
- Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (Q2799166) (← links)
- Sparse and Truncated Suffix Trees on Variable-Length Codes (Q3011859) (← links)
- TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS (Q3210891) (← links)
- INDEXING GAPPED-FACTORS USING A TREE (Q3532141) (← links)
- Reverse-Safe Text Indexing (Q5102053) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711551) (← links)
- Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)