The following pages link to (Q5501814):
Displayed 32 items.
- The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes (Q134868) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- Multikey quickselect (Q472494) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- New method in information processing for maintaining an efficient dynamic ordered set (Q848256) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Weighted height of random trees (Q934911) (← links)
- Improving multikey Quicksort for sorting strings with many equal elements (Q987791) (← links)
- Modified binary searching for static tables (Q1608338) (← links)
- In-memory hash tables for accumulating text vocabularies (Q1848541) (← links)
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
- Breadth-first search strategies for trie-based syntactic pattern recognition (Q2383946) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Faster semi-external suffix sorting (Q2445902) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Faster suffix sorting (Q2465058) (← links)
- Probabilistic analysis of algorithms for the Dutch national flag problem (Q2566022) (← links)
- Space efficient linear time construction of suffix arrays (Q2569393) (← links)
- D?E?K=(1000)8 (Q2772918) (← links)
- PSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix Arrays (Q3004672) (← links)
- A Fast Suffix-Sorting Algorithm (Q3439227) (← links)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
- (Q4791703) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Restricted rotation distance between k-ary trees (Q5886032) (← links)
- An experimental study of a compressed index (Q5944434) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)
- Dynamic Path-decomposed Tries (Q6039927) (← links)
- Compressed string dictionaries via data-aware subtrie compaction (Q6111589) (← links)