| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Quasi-Linear-Time Algorithm for Longest Common Circular Factor | Alzamel, Mai et al. | 2019 |
| 2 | Linear-Time Algorithm for Long LCF with k Mismatches | Charalampopoulos, Panagiotis et al. | 2018 |
| 3 | Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time | Crochemore, Maxime et al. | 2017 |
| 4 | Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111) | Crochemore, Maxime et al. | 2014 |
| 5 | Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) | Crochemore, Maxime et al. | 2011 |
| 6 | Reverse Engineering Prefix Tables | Clement, Julien et al. | 2009 |
| 7 | Improved Algorithms for the Range Next Value Problem and Applications | Iliopoulos, Costas S. et al. | 2008 |
| 8 | Understanding Maximal Repetitions in Strings | Crochemore, Maxime et al. | 2008 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |