| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Double String Tandem Repeats | Amir, Amihood et al. | 2020 |
| 2 | On Indeterminate Strings Matching | Gawrychowski, Paweł et al. | 2020 |
| 3 | Cartesian Tree Matching and Indexing | Park, Sung Gwan et al. | 2019 |
| 4 | Top Tree Compression of Tries | Bille, Philip et al. | 2019 |
| 5 | A Faster Construction of Greedy Consensus Trees | Gawrychowski, Pawel et al. | 2018 |
| 6 | Fast Entropy-Bounded String Dictionary Look-Up with Mismatches | Gawrychowski, Pawel et al. | 2018 |
| 7 | Two-Dimensional Maximal Repetitions | Amir, Amihood et al. | 2018 |
| 8 | The Nearest Colored Node in a Tree | Gawrychowski, Pawel et al. | 2016 |
| 9 | A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression | Hermelin, Danny et al. | 2009 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |