No. Title Author Year
1 Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard Gibney, Daniel et al. 2021
2 FM-Index Reveals the Reverse Suffix Array Ganguly, Arnab et al. 2020
3 On the Complexity of BWT-Runs Minimization via Alphabet Reordering Bentley, Jason W. et al. 2020
4 The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance Hoppenworth, Gary et al. 2020
5 On the Hardness and Inapproximability of Recognizing Wheeler Graphs Gibney, Daniel et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI