# Shunsuke Inenaga

According to our database1, Shunsuke Inenaga authored at least 182 papers between 2001 and 2018.

Collaborative distances:
• Dijkstra number2 of four.
• Erdős number3 of four.

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

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 hardness result and new algorithm for the longest common palindromic subsequence problem.
Inf. Process. Lett., 2018

Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions.
Int. J. Found. Comput. Sci., 2018

Diverse Palindromic Factorization is NP-Complete.
Int. J. Found. Comput. Sci., 2018

Right-to-left online construction of parameterized position heaps.
CoRR, 2018

O(n log n)-time text compression by LZ-style longest first substitution.
CoRR, 2018

Block Palindromes: A New Generalization of Palindromes.
CoRR, 2018

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
Proceedings of the String Processing and Information Retrieval, 2018

Block Palindromes: A New Generalization of Palindromes.
Proceedings of the String Processing and Information Retrieval, 2018

Longest Lyndon Substring After Edit.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Computing longest common square subsequences.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Lyndon Factorization of Grammar Compressed Texts Revisited.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Longest substring palindrome after edit.
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

The "Runs" Theorem.
SIAM J. Comput., 2017

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
IEICE Transactions, 2017

Efficient Dynamic Dictionary Matching with DAWGs and AC-automata.
CoRR, 2017

Small-space encoding LCE data structure with constant-time queries.
CoRR, 2017

Linear-size CDAWG: new repetition-aware indexing and grammar compression.
CoRR, 2017

Computing Abelian regularities on RLE strings.
CoRR, 2017

Order preserving pattern matching on trees and DAGs.
CoRR, 2017

Faster STR-IC-LCS computation via RLE.
CoRR, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
CoRR, 2017

Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
Algorithmica, 2017

On Reverse Engineering the Lyndon Tree.
Proceedings of the Prague Stringology Conference 2017, 2017

Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression.
Proceedings of the String Processing and Information Retrieval, 2017

Order Preserving Pattern Matching on Trees and DAGs.
Proceedings of the String Processing and Information Retrieval, 2017

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.
Proceedings of the String Processing and Information Retrieval, 2017

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Computing Longest Single-arm-gapped Palindromes in a String.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Small-Space LCE Data Structure with Constant-Time Queries.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Computing Abelian String Regularities Based on RLE.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Shortest Unique Palindromic Substring Queries in Optimal Time.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Tight Bounds on the Maximum Number of Shortest Unique Substrings.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Faster STR-IC-LCS Computation via RLE.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Computing All Distinct Squares in Linear Time for Integer Alphabets.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Generalized pattern matching and periodicity under substring consistent equivalence relations.
Theor. Comput. Sci., 2016

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
Theor. Comput. Sci., 2016

Closed factorization.
Discrete Applied Mathematics, 2016

Longest Common Subsequence in at Least k Length Order-isomorphic Substrings.
CoRR, 2016

Deterministic sub-linear space LCE data structures with efficient construction.
CoRR, 2016

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
CoRR, 2016

Dynamic index and LZ factorization in compressed space.
CoRR, 2016

Fully dynamic data structure for LCE queries in compressed space.
CoRR, 2016

Computing longest single-arm-gapped palindromes in a string.
CoRR, 2016

Shortest unique palindromic substring queries in optimal time.
CoRR, 2016

Tight bound on the maximum number of shortest unique substrings.
CoRR, 2016

A hardness result and new algorithm for the longest common palindromic subsequence problem.
CoRR, 2016

Computing All Distinct Squares in Linear Time for Integer Alphabets.
CoRR, 2016

Dynamic Index and LZ Factorization in Compressed Space.
Proceedings of the Prague Stringology Conference 2016, 2016

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.
Proceedings of the Prague Stringology Conference 2016, 2016

Efficiently Finding All Maximal alpha-gapped Repeats.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Compacting a Dynamic Edit Distance Table by RLE Compression.
Proceedings of the SOFSEM 2016: Theory and Practice 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

Shortest Unique Substring Queries on Run-Length Encoded Strings.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Finding Gapped Palindromes Online.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Fully-online Construction of Suffix Trees for Multiple Texts.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Factorizing a String into Squares in Linear Time.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Compressed automata for dictionary matching.
Theor. Comput. Sci., 2015

Dynamic edit distance table under a general weighted cost function.
J. Discrete Algorithms, 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

Fully-online construction of suffix trees and DAWGs for multiple texts.
CoRR, 2015

Dynamic index, LZ factorization, and LCE queries in compressed space.
CoRR, 2015

Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.
CoRR, 2015

Efficiently Finding All Maximal $α$-gapped Repeats.
CoRR, 2015

Diverse Palindromic Factorization is NP-Complete.
CoRR, 2015

Computing Left-Right Maximal Generic Words.
Proceedings of the Prague Stringology Conference 2015, 2015

A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications.
Proceedings of the Prague Stringology Conference 2015, 2015

A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.
Proceedings of the String Processing and Information Retrieval, 2015

Efficient Algorithms for Longest Closed Factor Array.
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

Diverse Palindromic Factorization Is NP-complete.
Proceedings of the Developments in Language Theory - 19th 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

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

An Opportunistic Text Indexing Structure Based on Run Length Encoding.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Inferring strings from suffix trees and links on a binary alphabet.
Discrete Applied Mathematics, 2014

A new characterization of maximal repetitions by Lyndon trees.
CoRR, 2014

Computing Abelian Covers and Abelian Runs.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Closed Factorization.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Faster Compact On-Line Lempel-Ziv Factorization.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Shortest Unique Substrings Queries in Optimal Time.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Inferring Strings from Lyndon Factorization.
Proceedings of the Mathematical Foundations of Computer Science 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

Fast q-gram mining on SLP compressed strings.
J. Discrete Algorithms, 2013

Foreword.
Int. J. Comput. Math., 2013

Faster Compact On-Line Lempel-Ziv Factorization
CoRR, 2013

Detecting regularities on grammar-compressed strings
CoRR, 2013

Efficient Lyndon factorization of grammar compressed text
CoRR, 2013

Computing convolution on grammar-compressed text
CoRR, 2013

Compressed Automata for Dictionary Matching.
Proceedings of the Implementation and Application of Automata, 2013

Computing Reversed Lempel-Ziv Factorization Online.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
Proceedings of the String Processing and Information Retrieval, 2013

Permuted Pattern Matching on Multi-track Strings.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Detecting Regularities on Grammar-Compressed Strings.
Proceedings of the Mathematical Foundations of Computer Science 2013, 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

Converting SLP to LZ78 in almost Linear Time.
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

Finding Characteristic Substrings from Compressed Texts.
Int. J. Found. Comput. Sci., 2012

Efficient LZ78 factorization of grammar compressed text
CoRR, 2012

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding
CoRR, 2012

Speeding-up $q$-gram mining on grammar-based compressed texts
CoRR, 2012

The Position Heap of a Trie.
Proceedings of the String Processing and Information Retrieval, 2012

Efficient LZ78 Factorization of Grammar Compressed Text.
Proceedings of the String Processing and Information Retrieval, 2012

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Verifying and enumerating parameterized border arrays.
Theor. Comput. Sci., 2011

Password Based Anonymous Authentication with Private Information Retrieval.
JDIM, 2011

Missing pattern discovery.
J. Discrete Algorithms, 2011

Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts
CoRR, 2011

Computing q-gram Frequencies on Collage Systems
CoRR, 2011

Restructuring Compressed Texts without Explicit Decompression
CoRR, 2011

Fast $q$-gram Mining on SLP Compressed Strings
CoRR, 2011

Computing Longest Common Substring/Subsequence of Non-linear Texts.
Proceedings of the Prague Stringology Conference 2011, 2011

Inferring Strings from Suffix Trees and Links on a Binary Alphabet.
Proceedings of the Prague Stringology Conference 2011, 2011

Fast q-gram Mining on SLP Compressed Strings.
Proceedings of the String Processing and Information Retrieval, 2011

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Palindrome Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

An Anonymous Authentication Protocol with Single-database PIR.
Proceedings of the Ninth Australasian Information Security Conference, 2011

2010
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs.
Chicago J. Theor. Comput. Sci., 2010

Counting and Verifying Maximal Palindromes.
Proceedings of the String Processing and Information Retrieval, 2010

Dynamic Edit Distance Table under a General Weighted Cost Function.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services.
Proceedings of the Computational Science and Its Applications, 2010

Verifying a Parameterized Border Array in O(n1.5) Time.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Efficient algorithms to compute compressed longest common substrings and compressed palindromes.
Theor. Comput. Sci., 2009

Linear-Time Text Compression by Longest-First Substitution.
Algorithms, 2009

Finding Characteristic Substrings from Compressed Texts.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Modeling Costs of Access Control with Various Key Management Systems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2009

Towards Modeling Stored-value Electronic Money Systems.
Proceedings of the World Congress on Nature & Biologically Inspired Computing, 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

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program.
Proceedings of the Theory of Computing 2009, 2009

2008
Reachability on Suffix Tree Graphs.
Int. J. Found. Comput. Sci., 2008

Parameterized Suffix Arrays for Binary Strings.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Computing Longest Common Substring and All Palindromes from Compressed Strings.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

String Kernels Based on Variable-Length-Don't-Care Patterns.
Proceedings of the Discovery Science, 11th International Conference, 2008

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

2007
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Sparse compact directed acyclic word graphs.
Proceedings of the Prague Stringology Conference, 2006

Reachability on suffix tree graphs.
Proceedings of the Prague Stringology Conference, 2006

Sparse Directed Acyclic Word Graphs.
Proceedings of the String Processing and Information Retrieval, 2006

A New Family of String Classifiers Based on Local Relatedness.
Proceedings of the Discovery Science, 9th International Conference, 2006

On-Line Linear-Time Construction of Word Suffix Trees.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
A fully compressed pattern matching algorithm for simple collage systems.
Int. J. Found. Comput. Sci., 2005

On-line construction of compact directed acyclic word graphs.
Discrete Applied Mathematics, 2005

Composite Pattern Discovery for PCR Application.
Proceedings of the String Processing and Information Retrieval, 2005

Fully Incremental LCS Computation.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Practical Algorithms for Pattern Based Linear Regression.
Proceedings of the Discovery Science, 8th International Conference, 2005

2004
Ternary directed acyclic word graphs.
Theor. Comput. Sci., 2004

Compact directed acyclic word graphs for a sliding window.
J. Discrete Algorithms, 2004

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
J. Bioinformatics and Computational Biology, 2004

Finding Missing Patterns.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
Proceedings of the Developments in Language Theory, 2004

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Proceedings of the Discovery Science, 7th International Conference, 2004

2003
Bidirectional Construction of Suffix Trees.
Nord. J. Comput., 2003

A Note on Randomized Algorithm for String Matching with Mismatches.
Nord. J. Comput., 2003

Ternary Directed Acyclic Word Graphs.
Proceedings of the Implementation and Application of Automata, 2003

Linear-Time Off-Line Text Compression by Longest-First Substitution.
Proceedings of the String Processing and Information Retrieval, 2003

Inferring Strings from Graphs and Arrays.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
Proceedings of the Discovery Science, 6th International Conference, 2003

2002
Bidirectional Construction of Suffix Trees.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

A Note on Randomized Algorithm for String Matching with Mismatches.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

Compact Directed Acyclic Word Graphs for a Sliding Window.
Proceedings of the String Processing and Information Retrieval, 2002

Space-Economical Construction of Index Structures for All Suffixes of a String.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Finding Best Patterns Practically.
Proceedings of the Progress in Discovery Science, 2002

Discovering Best Variable-Length-Don't-Care Patterns.
Proceedings of the Discovery Science, 5th International Conference, 2002

The Minimum DAWG for All Suffixes of a String and Its Applications.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Construction of the CDAWG for a Trie.
Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

A Practical Algorithm to Find the Best Episode Patterns.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

On-Line Construction of Compact Directed Acyclic Word Graphs.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001