Masayuki Takeda

Nobuyuki Yamasaki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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

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

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

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

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

Fabrication of Nb2O5 horizontal slot waveguide structures.

[BibT_eX]

[DOI]

Proceedings of the 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC), 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

Finding the Maximum Number of Symbols for the 4b/10b Line Code with Error Correction.

[BibT_eX]

[DOI]

Nobuyuki Yamasaki

Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 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

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

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

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

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

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

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

2016

Pattern Matching on Compressed Text.

[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

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

A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 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

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

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

An Improved Evacuation Guidance System Based on Ant Colony Optimization.

[BibT_eX]

[DOI]

Proceedings of the Intelligent and Evolutionary Systems - The 19th Asia Pacific Symposium, 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

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

Computing Palindromic Factorizations and Palindromic Covers On-line.

[BibT_eX]

[DOI]

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

2013

Palindrome pattern matching.

[BibT_eX]

[DOI]

Tomohiro I

Theor. Comput. Sci., 2013

Fast q-gram mining on SLP compressed strings.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Computing Reversed Lempel-Ziv Factorization Online.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 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

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

Online Rank Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 4th Asian Conference on Machine Learning, 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

An Online Algorithm for Lightweight Grammar-Based Compression.

[BibT_eX]

[DOI]

Shirou Maruyama

Hiroshi Sakamoto

Algorithms, 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]

Hideo Bannai

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

Adaptive Online Prediction Using Weighted Windows.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 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

Online Linear Optimization over Permutations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 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

An Online Algorithm for Lightweight Grammar-Based Compression.

[BibT_eX]

[DOI]

Proceedings of the First International Conference on Data Compression, 2011

2010

Context-Sensitive Grammar Transform: Compression and Pattern Matching.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 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

Chimera: Stream-Oriented XML Filtering/Querying Engine.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 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

A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.

[BibT_eX]

[DOI]

Tetsuya Matsumoto

Kazuhito Hagio

Int. J. Found. Comput. Sci., 2009

Linear-Time Text Compression by Longest-First Substitution.

[BibT_eX]

[DOI]

Algorithms, 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

2008

Compressed Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Reachability on Suffix Tree Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 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

Online Learning of Maximum p-Norm Margin Classifiers with Bias.

[BibT_eX]

[DOI]

Kosuke Ishibashi

Kohei Hatano

Proceedings of the 21st Annual Conference on Learning Theory, 2008

Smooth Boosting for Margin-Based Ranking.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

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

Sparse compact directed acyclic word graphs.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference, 2006

Sparse Directed Acyclic Word Graphs.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2006

A New Family of String Classifiers Based on Local Relatedness.

[BibT_eX]

[DOI]

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

On-Line Linear-Time Construction of Word Suffix Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Behavioral Analysis Based on Relations in Weblogs.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web, 2006

Users' Behavioral Analysis on Weblogs.

[BibT_eX]

[DOI]

Proceedings of the Computational Approaches to Analyzing Weblogs, 2006

2005

A fully compressed pattern matching algorithm for simple collage systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

On-line construction of compact directed acyclic word graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's.

[BibT_eX]

[DOI]

Hisashi Tsuji

Akira Ishino

Proceedings of the String Processing and Information Retrieval, 2005

Analysis of User's Relation and Reading Activity in Weblogs.

[BibT_eX]

[DOI]

Proceedings of the New Frontiers in Artificial Intelligence, 2005

ism: Improvisation Supporting Systems with Melody Correction and Key Vibration.

[BibT_eX]

[DOI]

Tetsuro Kitahara

Katsuhisa Ishida

Proceedings of the Entertainment Computing, 2005

A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices.

[BibT_eX]

[DOI]

Naoki Mori

Keinosuke Matsumoto

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Fully Incremental LCS Computation.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Practical Algorithms for Pattern Based Linear Regression.

[BibT_eX]

[DOI]

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

2004

Ternary directed acyclic word graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

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

[BibT_eX]

[DOI]

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

Compact directed acyclic word graphs for a sliding window.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 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

ism: Improvisation Supporting System based on Melody Correction.

[BibT_eX]

[DOI]

Katsuhisa Ishida

Tetsuro Kitahara

Proceedings of the New Interfaces for Musical Expression, 2004

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

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

[BibT_eX]

[DOI]

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

On Bit-Parallel Processing of Multi-byte Text.

[BibT_eX]

[DOI]

Proceedings of the Information Retrieval Technology, Asia Information Retrieval Symposium, 2004

2003

Discovering characteristic expressions in literary works.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Discovering instances of poetic allusion from anthologies of classical Japanese poems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Collage system: a unifying framework for compressed pattern matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A practical algorithm to find the best subsequence patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Uniform characterizations of polynomial-query learnabilities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Note on Randomized Algorithm for String Matching with Mismatches.

[BibT_eX]

Nord. J. Comput., 2003

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

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

Inferring Strings from Graphs and Arrays.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

On the Length of the Minimum Solution of Word Equations in One Variable.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.

[BibT_eX]

[DOI]

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

A Method of Extracting Related Words Using Standardized Mutual Information.

[BibT_eX]

[DOI]

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

2002

Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 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

Mining from Literary Texts: Pattern Discovery and Similarity Computation.

[BibT_eX]

[DOI]

Tomoko Fukuda

Ichiro Nanri

Proceedings of the Progress in Discovery Science, 2002

Finding Best Patterns Practically.

[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

The Minimum DAWG for All Suffixes of a String and Its Applications.

[BibT_eX]

[DOI]

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

2001

Construction of the CDAWG for a Trie.

[BibT_eX]

[DOI]

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

Musical Sequence Comparison for Melodic and Rhythmic Similarities.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems.

[BibT_eX]

[DOI]

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

A Practical Algorithm to Find the Best Episode Patterns.

[BibT_eX]

[DOI]

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

Faster Approximate String Matching over Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

Compressed Pattern Matching for SEQUITUR.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2001

String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Multiple Pattern Matching Algorithms on Collage System.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Discovery Characteristic Patterns from Collections of Classical Japanese Poems.

[BibT_eX]

[DOI]

New Gener. Comput., 2000

Bit-Parallel Approach to Approximate String Matching in Compressed Texts.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Online Construction of Subsequence Automata for Multiple Texts.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 2000

A Boyer-Moore Type Algorithm for Compressed Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Speeding Up Pattern Matching by Text Compression.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

A Unifying Framework for Compressed Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Discovering Poetic Allusion in Anthologies of Classical Japanese Poems.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 1999

Pattern Matching in Text Compressed by Using Antidictionaries.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Shift-And Approach to Pattern Matching in LZW Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998

Discovering Characteristic Patterns from Collections of Classical Japanese Poems.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 1998

Multiple Pattern Matching in LZW Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.

[BibT_eX]

[DOI]

Masamichi Miyazaki

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1993

A Fast String-Searching Algorithm for Multiple Patterns.

[BibT_eX]

[DOI]

Noriyoshi Uratani