Pages that link to "Item:Q2376800"

The following pages link to Near real-time suffix tree construction via the fringe marked ancestor problem (Q2376800):

Displayed 11 items.

• Linear-size suffix tries (Q294967) ‎ (← links)
• On suffix extensions in suffix trees (Q714837) ‎ (← links)
• Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) ‎ (← links)
• Suffix trays and suffix trists: structures for faster text indexing (Q2354023) ‎ (← links)
• Full-fledged real-time indexing for constant size alphabets (Q2408918) ‎ (← links)
• Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) ‎ (← links)
• Online Detection of Repetitions with Backtracking (Q2942265) ‎ (← links)
• The longest common substring problem (Q2971067) ‎ (← links)
• Online algorithms for constructing linear-size suffix trie (Q5088922) ‎ (← links)
• Searching Long Repeats in Streams (Q5088923) ‎ (← links)
• The Online House Numbering Problem: Min-Max Online List Labeling (Q5111720) ‎ (← links)