2025
Inverting Parameterized Burrows-Wheeler Transform.
CoRR, March, 2025
2024
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences.
Algorithmica, March, 2024
On the compressiveness of the Burrows-Wheeler transform.
CoRR, 2024
Space-Efficient SLP Encoding for O(log N)-Time Random Access.
Proceedings of the String Processing and Information Retrieval, 2024
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
On the Hardness of Smallest RLSLPs and Collage Systems.
Proceedings of the Data Compression Conference, 2024
2023
Longest bordered and periodic subsequences.
Inf. Process. Lett., August, 2023
PalFM-Index: FM-Index for Palindrome Pattern Matching.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023
2022
LCP-dropout: Compression-based Multiple Subword Segmentation for Neural Machine Translation.
CoRR, 2022
Longest (Sub-)Periodic Subsequence.
CoRR, 2022
Privacy-Preserving Feature Selection with Fully Homomorphic Encryption.
Algorithms, 2022
Substring Complexities on Run-Length Compressed Strings.
Proceedings of the String Processing and Information Retrieval, 2022
Space-Efficient B Trees via Load-Balancing.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022
Computing Longest (Common) Lyndon Subsequences.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022
Converting RLBWT to LZ77 in smaller space.
Proceedings of the Data Compression Conference, 2022
2021
Privacy-Preserving Multiparty Protocol for Feature Selection Problem.
CoRR, 2021
Load-Balancing Succinct B Trees.
CoRR, 2021
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree.
Proceedings of the String Processing and Information Retrieval, 2021
A Separation of γ and b via Thue-Morse Words.
Proceedings of the String Processing and Information Retrieval, 2021
PHONI: Streamed Matching Statistics with Multi-Genome References.
Proceedings of the 31st Data Compression Conference, 2021
2020
Refining the <i>r</i>-index.
Theor. Comput. Sci., 2020
Deterministic Sparse Suffix Sorting in the Restore Model.
ACM Trans. Algorithms, 2020
Dynamic index and LZ factorization in compressed space.
Discret. Appl. Math., 2020
Faster Privacy-Preserving Computation of Edit Distance with Moves.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020
Practical Random Access to SLP-Compressed Texts.
Proceedings of the String Processing and Information Retrieval, 2020
2019
Improved upper bounds on all maximal <i>α</i>-gapped repeats and palindromes.
Theor. Comput. Sci., 2019
Tree-Shape Grammars for Random Access.
CoRR, 2019
<i>k</i>-Abelian Pattern Matching: Revisited, Corrected, and Extended.
Proceedings of the Prague Stringology Conference 2019, 2019
Rpair: Rescaling RePair with Rsync.
Proceedings of the String Processing and Information Retrieval, 2019
RePair in Compressed Space and Time.
Proceedings of the Data Compression Conference, 2019
2018
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.
Theory Comput. Syst., 2018
A faster implementation of online RLBWT and its application to LZ77 parsing.
J. Discrete Algorithms, 2018
Approximate Frequent Pattern Discovery in Compressed Space.
IEICE Trans. Inf. Syst., 2018
Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes.
CoRR, 2018
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees.
Algorithmica, 2018
Block Palindromes: A New Generalization of Palindromes.
Proceedings of the String Processing and Information Retrieval, 2018
Privacy-Preserving String Edit Distance with Moves.
Proceedings of the Similarity Search and Applications - 11th International Conference, 2018
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
The Runs Theorem and Beyond.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
Lyndon Factorization of Grammar Compressed Texts Revisited.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018
Online LZ77 Parsing and Matching Statistics with RLBWTs.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018
Faster Online Elastic Degenerate String Matching.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018
2017
Inferring strings from Lyndon factorization.
Theor. Comput. Sci., 2017
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
A Space-Optimal Grammar Compression.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Longest Common Extensions with Recompression.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017
2016
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
Theor. Comput. Sci., 2016
Discret. Appl. Math., 2016
Efficiently Finding All Maximal alpha-gapped Repeats.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Fully Dynamic Data Structure for LCE Queries in Compressed Space.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Deterministic Sparse Suffix Sorting on Rewritable Texts.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016
Online Grammar Compression for Frequent Pattern Discovery.
Proceedings of the 13th International Conference on Grammatical Inference, 2016
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016
2015
Compressed automata for dictionary matching.
Theor. Comput. Sci., 2015
Constructing LZ78 tries and position heaps in linear time for large alphabets.
Inf. Process. Lett., 2015
Detecting regularities on grammar-compressed strings.
Inf. Comput., 2015
Dynamic index, LZ factorization, and LCE queries in compressed space.
CoRR, 2015
Efficiently Finding All Maximal $α$-gapped Repeats.
CoRR, 2015
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.
Proceedings of the String Processing and Information Retrieval, 2015
Proceedings of the String Processing and Information Retrieval, 2015
A new characterization of maximal repetitions by Lyndon trees.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Inferring Strings from Full Abelian Periods.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Arithmetics on Suffix Arrays of Fibonacci Words.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015
Lempel Ziv Computation in Small Space (LZ-CISS).
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015
2014
Inferring strings from suffix trees and links on a binary alphabet.
Discret. Appl. Math., 2014
Faster Compact On-Line Lempel-Ziv Factorization.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Faster Sparse Suffix Sorting.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Computing Palindromic Factorizations and Palindromic Covers On-line.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014
2013
Palindrome pattern matching.
Theor. Comput. Sci., 2013
Computing Reversed Lempel-Ziv Factorization Online.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013
Computing Convolution on Grammar-Compressed Text.
Proceedings of the 2013 Data Compression Conference, 2013
From Run Length Encoding to LZ78 and Back Again.
Proceedings of the 2013 Data Compression Conference, 2013
Efficient Lyndon Factorization of Grammar Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013
2012
An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Inf. Process. Lett., 2012
The Position Heap of a Trie.
Proceedings of the String Processing and Information Retrieval, 2012
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012
2011
Verifying and enumerating parameterized border arrays.
Theor. Comput. Sci., 2011
2010
Counting and Verifying Maximal Palindromes.
Proceedings of the String Processing and Information Retrieval, 2010
Verifying a Parameterized Border Array in <i>O</i>(<i>n</i><sup>1.5</sup>) Time.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010
2009
Counting Parameterized Border Arrays for a Binary Alphabet.
Proceedings of the Language and Automata Theory and Applications, 2009
Lightweight Parameterized Suffix Array Construction.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009