Hideo Bannai

Proceedings of the String Processing and Information Retrieval, 2024

Edit and Alphabet-Ordering Sensitivity of Lex-Parse.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Computing Maximal Palindromes in Non-standard Matching Models.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Height-Bounded Lempel-Ziv Encodings.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

On the Hardness of Smallest RLSLPs and Collage Systems.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2024

Maintaining the Size of LZ77 on Semi-Dynamic Strings.

[BibT_eX]

[DOI]

Panagiotis Charalampopoulos

Jakub Radoszewski

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

Longest bordered and periodic subsequences.

[BibT_eX]

[DOI]

Inf. Process. Lett., August, 2023

Sliding suffix trees simplified.

[BibT_eX]

[DOI]

CoRR, 2023

Acceleration of FM-Index Queries Through Prefix-Free Parsing.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2023

Space-Efficient STR-IC-LCS Computation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Lyndon Arrays in Sublinear Time.

[BibT_eX]

[DOI]

Jonas Ellert

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Optimal LZ-End Parsing Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Combinatorics of minimal absent words for a sliding window.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Factorizing Strings into Repetitions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Palindromic trees for a sliding window and its applications.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

c-trie++: A dynamic trie tailored for fast prefix searches.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Order-preserving pattern matching indeterminate strings.

[BibT_eX]

[DOI]

Alexandre P. Francisco

Inf. Comput., 2022

Computing maximal generalized palindromes.

[BibT_eX]

[DOI]

CoRR, 2022

Longest (Sub-)Periodic Subsequence.

[BibT_eX]

[DOI]

CoRR, 2022

Computing Minimal Unique Substrings for a Sliding Window.

[BibT_eX]

[DOI]

Algorithmica, 2022

Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

Computing Longest (Common) Lyndon Subsequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Computing NP-Hard Repetitiveness Measures via MAX-SAT.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

The Smallest Grammar Problem Revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Efficiently computing runs on a trie.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Computing longest palindromic substring after single-character or block-wise edits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Longest previous overlapping factor array.

[BibT_eX]

[DOI]

Neerja Mhaskar

Inf. Process. Lett., 2021

Compressed Communication Complexity of Hamming Distance.

[BibT_eX]

[DOI]

Algorithms, 2021

Longest Common Rollercoasters.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

A Separation of γ and b via Thue-Morse Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Grammar Index by Induced Suffix Sorting.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2021

Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

Repetitions in Strings: A "Constant" Problem (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

The Parameterized Suffix Tray.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Space-efficient algorithms for computing minimal/shortest unique substrings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Refining the r-index.

[BibT_eX]

[DOI]

Travis Gagie

Theor. Comput. Sci., 2020

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Dynamic index and LZ factorization in compressed space.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Computing Palindromic Trees for a Sliding Window and Its Applications.

[BibT_eX]

[DOI]

CoRR, 2020

Grammar-compressed Self-index with Lyndon Words.

[BibT_eX]

[DOI]

CoRR, 2020

Finding all maximal perfect haplotype blocks in linear time.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2020

Practical Grammar Compression Based on Maximal Repeats.

[BibT_eX]

[DOI]

Algorithms, 2020

More Time-Space Tradeoffs for Finding a Shortest Unique Substring.

[BibT_eX]

[DOI]

Algorithms, 2020

Towards Efficient Interactive Computation of Dynamic Time Warping Distance.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

On Repetitiveness Measures of Thue-Morse Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2020

Longest Square Subsequence Problem Revisited.

[BibT_eX]

[DOI]

Takafumi Inoue

Proceedings of the String Processing and Information Retrieval, 2020

Lyndon Words, the Three Squares Lemma, and Primitive Squares.

[BibT_eX]

[DOI]

Takuya Mieno

Yuto Nakashima

Proceedings of the String Processing and Information Retrieval, 2020

Faster STR-EC-LCS Computation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

On the size of the smallest alphabet for Lyndon trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Constructing the Bijective BWT.

[BibT_eX]

[DOI]

CoRR, 2019

Dynamic Packed Compact Tries Revisited.

[BibT_eX]

[DOI]

CoRR, 2019

Computing Maximal Palindromes and Distinct Palindromes in a Trie.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2019, 2019

k-Abelian Pattern Matching: Revisited, Corrected, and Extended.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2019, 2019

Compact Data Structures for Shortest Unique Substring Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

On Longest Common Property Preserved Substring Queries.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

An Improved Data Structure for Left-Right Maximal Generic Words Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

MR-RePair: Grammar Compression Based on Maximal Repeats.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2019

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Computing Runs on a Trie.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Faster Queries for Longest Substring Palindrome After Block Edit.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Indexing the Bijective BWT.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

The Parameterized Position Heap of a Trie.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Algorithms and combinatorial properties on shortest unique palindromic substrings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Diverse Palindromic Factorization is NP-Complete.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

O(n log n)-time Text Compression by LZ-style Longest First Substitution.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2018, 2018

Right-to-left Online Construction of Parameterized Position Heaps.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2018, 2018

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Block Palindromes: A New Generalization of Palindromes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Longest Lyndon Substring After Edit.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Computing longest common square subsequences.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Order-Preserving Pattern Matching Indeterminate Strings.

[BibT_eX]

[DOI]

Rui Henriques

Alexandre P. Francisco

Luís M. S. Russo

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Lyndon Factorization of Grammar Compressed Texts Revisited.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Longest substring palindrome after edit.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Online LZ77 Parsing and Matching Statistics with RLBWTs.

[BibT_eX]

[DOI]

Travis Gagie

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Faster Online Elastic Degenerate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Inferring strings from Lyndon factorization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The "Runs" Theorem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Computing Abelian regularities on RLE strings.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Computation of Substring Equivalence Classes with Suffix Arrays.

[BibT_eX]

[DOI]

Algorithmica, 2017

On Reverse Engineering the Lyndon Tree.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

Order Preserving Pattern Matching on Trees and DAGs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Small-Space LCE Data Structure with Constant-Time Queries.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Computing Abelian String Regularities Based on RLE.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Shortest Unique Palindromic Substring Queries in Optimal Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Tight Bounds on the Maximum Number of Shortest Unique Substrings.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Faster STR-IC-LCS Computation via RLE.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Computing All Distinct Squares in Linear Time for Integer Alphabets.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Grammar Compression.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Generalized pattern matching and periodicity under substring consistent equivalence relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Closed factorization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Tight bound on the maximum number of shortest unique substrings.

[BibT_eX]

[DOI]

CoRR, 2016

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2016, 2016

Fully Dynamic Data Structure for LCE Queries in Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Shortest Unique Substring Queries on Run-Length Encoded Strings.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Finding Gapped Palindromes Online.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Factorizing a String into Squares in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Compressed automata for dictionary matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Editorial.

[BibT_eX]

[DOI]

Solon P. Pissis

J. Discrete Algorithms, 2015

Constructing LZ78 tries and position heaps in linear time for large alphabets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Detecting regularities on grammar-compressed strings.

[BibT_eX]

[DOI]

Inf. Comput., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Computing Left-Right Maximal Generic Words.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2015, 2015

A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Efficient Algorithms for Longest Closed Factor Array.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

A new characterization of maximal repetitions by Lyndon trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Inferring Strings from Full Abelian Periods.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Diverse Palindromic Factorization Is NP-complete.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

An Opportunistic Text Indexing Structure Based on Run Length Encoding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

On the existence of tight relative 2-designs on binary Hamming association schemes.

[BibT_eX]

[DOI]

Eiichi Bannai

Etsuko Bannai

Discret. Math., 2014

Inferring strings from suffix trees and links on a binary alphabet.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Computing Abelian Covers and Abelian Runs.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Faster Compact On-Line Lempel-Ziv Factorization.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Shortest Unique Substrings Queries in Optimal Time.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets.

[BibT_eX]

[DOI]

Keisuke Goto

Proceedings of the Data Compression Conference, 2014

Computing Palindromic Factorizations and Palindromic Covers On-line.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Fast q-gram mining on SLP compressed strings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets.

[BibT_eX]

[DOI]

Keisuke Goto

CoRR, 2013

Computing Reversed Lempel-Ziv Factorization Online.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Permuted Pattern Matching on Multi-track Strings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Computing Convolution on Grammar-Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

From Run Length Encoding to LZ78 and Back Again.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

Simpler and Faster Lempel Ziv Factorization.

[BibT_eX]

[DOI]

Keisuke Goto

Proceedings of the 2013 Data Compression Conference, 2013

Efficient Lyndon Factorization of Grammar Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Converting SLP to LZ78 in almost Linear Time.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Finding Characteristic Substrings from Compressed Texts.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

The Position Heap of a Trie.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Eager XPath Evaluation over XML Streams.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Efficient LZ78 Factorization of Grammar Compressed Text.

[BibT_eX]

[DOI]

Masayuki Takeda

Proceedings of the String Processing and Information Retrieval, 2012

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions.

[BibT_eX]

[DOI]

Proceedings of the 13th International Society for Music Information Retrieval Conference, 2012

Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Verifying and enumerating parameterized border arrays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Computing q-gram Frequencies on Collage Systems

[BibT_eX]

[DOI]

CoRR, 2011

Restructuring Compressed Texts without Explicit Decompression

[BibT_eX]

[DOI]

CoRR, 2011

Computing Longest Common Substring/Subsequence of Non-linear Texts.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2011, 2011

Efficient Eager XPath Filtering over XML Streams.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2011, 2011

Music Genre Classification using Similarity Functions.

[BibT_eX]

[DOI]

Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.

[BibT_eX]

[DOI]

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

2010

The Number of Runs in a Ternary Word.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Counting and Verifying Maximal Palindromes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 13th International Conference, 2010

Verifying a Parameterized Border Array in O(n1.5) Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Linear-Time Text Compression by Longest-First Substitution.

[BibT_eX]

[DOI]

Algorithms, 2009

Bit-parallel Algorithms for Computing all the Runs in a String.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

A Series of Run-Rich Strings.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Counting Parameterized Border Arrays for a Binary Alphabet.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Lightweight Parameterized Suffix Array Construction.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 12th International Conference, 2009

2008

Reachability on Suffix Tree Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Uniqueness of certain association schemes.

[BibT_eX]

[DOI]

Eiichi Bannai

Etsuko Bannai

Eur. J. Comb., 2008

New Lower Bounds for the Maximum Number of Runs in a String.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Parameterized Suffix Arrays for Binary Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

String Kernels Based on Variable-Length-Don't-Care Patterns.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 11th International Conference, 2008

2007

On the complexity of deriving position specific score matrices from positive and negative sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Algorithms for String Pattern Discovery.

[BibT_eX]

[DOI]

Proceedings of the Modeling Decisions for Artificial Intelligence, 2007

Unsupervised Spam Detection Based on String Alienness Measures.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 10th International Conference, 2007

Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.

[BibT_eX]

[DOI]

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

Efficient Computation of Substring Equivalence Classes with Suffix Arrays.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

A New Family of String Classifiers Based on Local Relatedness.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 9th International Conference, 2006

2005

Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2005

Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2005

Practical Algorithms for Pattern Based Linear Regression.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 8th International Conference, 2005

2004

An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

Finding Optimal Pairs of Patterns.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 7th International Conference, 2004

2003

The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation.

[BibT_eX]

[DOI]

Eijiro Sumii

J. Funct. Log. Program., 2003

Intrasplicing - Analysis of Long Intron Sequences.

[BibT_eX]

[DOI]

Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

Inferring Strings from Graphs and Arrays.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection.

[BibT_eX]

Proceedings of the European Conference on Computational Biology (ECCB 2003), 2003

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 6th International Conference, 2003

2002

Fast algorithm for extracting multiple unordered short motifs using bit operations.

[BibT_eX]

[DOI]

Inf. Sci., 2002

Extensive feature detection of N-terminal protein sorting signals.

[BibT_eX]

[DOI]

Bioinform., 2002

Space-Economical Construction of Index Structures for All Suffixes of a String.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

VM lambda: A Functional Calculusfor Scientific Discovery.

[BibT_eX]

[DOI]

Eijiro Sumii

Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

Foundations of Designing Computational Knowledge Discovery Processes.

[BibT_eX]

[DOI]

Proceedings of the Progress in Discovery Science, 2002

Discovering Best Variable-Length-Don't-Care Patterns.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 5th International Conference, 2002

On the Complexity of Deriving Position Specific Score Matrices from Examples.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process.

[BibT_eX]

[DOI]

Electron. Trans. Artif. Intell., 2001

Views: Fundamental Building Blocks in the Process of Knowledge Discovery.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, 2001

VML: A View Modeling Language for Computational Knowledge Discovery.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

VM lambda: a Functional Calculus for Scientific Discovery.

[BibT_eX]

Eijiro Sumii

Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001

1999

A Definition of Discovery in Terms of Generalized Descriptional Complexity.

[BibT_eX]

[DOI]