Masayuki Takeda

According to our database1, Masayuki Takeda authored at least 177 papers between 1993 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Dynamic index and LZ factorization in compressed space.
Discret. Appl. Math., 2020

Faster STR-EC-LCS Computation.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
On the size of the smallest alphabet for Lyndon trees.
Theor. Comput. Sci., 2019

Dynamic Packed Compact Tries Revisited.
CoRR, 2019

Computing Maximal Palindromes and Distinct Palindromes in a Trie.
Proceedings of the Prague Stringology Conference 2019, 2019

Compact Data Structures for Shortest Unique Substring Queries.
Proceedings of the String Processing and Information Retrieval, 2019

On Longest Common Property Preserved Substring Queries.
Proceedings of the String Processing and Information Retrieval, 2019

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
Proceedings of the String Processing and Information Retrieval, 2019

Fabrication of Nb2O5 horizontal slot waveguide structures.
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.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

An Improved Data Structure for Left-Right Maximal Generic Words Problem.
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.
Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 2019

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Computing Runs on a Trie.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Faster Queries for Longest Substring Palindrome After Block Edit.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

The Parameterized Position Heap of a Trie.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Algorithms and combinatorial properties on shortest unique palindromic substrings.
J. Discrete Algorithms, 2018

O(n log n)-time Text Compression by LZ-style Longest First Substitution.
Proceedings of the Prague Stringology Conference 2018, 2018

Right-to-left Online Construction of Parameterized Position Heaps.
Proceedings of the Prague Stringology Conference 2018, 2018

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
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

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

Computing Abelian regularities on RLE strings.
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

Order Preserving Pattern Matching on Trees and DAGs.
Proceedings of the String Processing and Information Retrieval, 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

2016
Pattern Matching on Compressed Text.
Encyclopedia of Algorithms, 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

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

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.
Proceedings of the Prague Stringology Conference 2016, 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

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

A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization.
Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016), 2016

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
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

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

Computing Left-Right Maximal Generic Words.
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

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

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.
Discret. Appl. Math., 2014

Computing Abelian Covers and Abelian Runs.
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

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

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

Converting SLP to LZ78 in almost Linear Time.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
Online Rank Aggregation.
Proceedings of the 4th Asian Conference on Machine Learning, 2012

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

An Online Algorithm for Lightweight Grammar-Based Compression.
Algorithms, 2012

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

Eager XPath Evaluation over XML Streams.
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

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions.
Proceedings of the 13th International Society for Music Information Retrieval Conference, 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

Adaptive Online Prediction Using Weighted Windows.
IEICE Transactions, 2011

Computing q-gram Frequencies on Collage Systems
CoRR, 2011

Restructuring Compressed Texts without Explicit Decompression
CoRR, 2011

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

Efficient Eager XPath Filtering over XML Streams.
Proceedings of the Prague Stringology Conference 2011, 2011

Music Genre Classification using Similarity Functions.
Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

Online Linear Optimization over Permutations.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

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

An Online Algorithm for Lightweight Grammar-Based Compression.
Proceedings of the First International Conference on Data Compression, 2011

2010
Context-Sensitive Grammar Transform: Compression and Pattern Matching.
IEICE Transactions, 2010

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

Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.
Proceedings of the Discovery Science - 13th International Conference, 2010

Chimera: Stream-Oriented XML Filtering/Querying Engine.
Proceedings of the Database Systems for Advanced Applications, 2010

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

2009
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.
Int. J. Found. Comput. Sci., 2009

Linear-Time Text Compression by Longest-First Substitution.
Algorithms, 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

2008
Compressed Pattern Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 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

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

Online Learning of Maximum p-Norm Margin Classifiers with Bias.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

Smooth Boosting for Margin-Based Ranking.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
Unsupervised Spam Detection Based on String Alienness Measures.
Proceedings of the Discovery Science, 10th International Conference, 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

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

Behavioral Analysis Based on Relations in Weblogs.
Proceedings of the Semantic Web, 2006

Users' Behavioral Analysis on Weblogs.
Proceedings of the Computational Approaches to Analyzing Weblogs, 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.
Discret. Appl. Math., 2005

A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's.
Proceedings of the String Processing and Information Retrieval, 2005

Analysis of User's Relation and Reading Activity in Weblogs.
Proceedings of the New Frontiers in Artificial Intelligence, 2005

ism: Improvisation Supporting Systems with Melody Correction and Key Vibration.
Proceedings of the Entertainment Computing, 2005

A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices.
Proceedings of the Genetic and Evolutionary Computation Conference, 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

An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.
IEEE/ACM Trans. Comput. Biology Bioinform., 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 Optimal Pairs of Patterns.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

ism: Improvisation Supporting System based on Melody Correction.
Proceedings of the New Interfaces for Musical Expression, 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

On Bit-Parallel Processing of Multi-byte Text.
Proceedings of the Information Retrieval Technology, Asia Information Retrieval Symposium, 2004

2003
Discovering characteristic expressions in literary works.
Theor. Comput. Sci., 2003

Discovering instances of poetic allusion from anthologies of classical Japanese poems.
Theor. Comput. Sci., 2003

Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci., 2003

A practical algorithm to find the best subsequence patterns.
Theor. Comput. Sci., 2003

Uniform characterizations of polynomial-query learnabilities.
Theor. Comput. Sci., 2003

A Note on Randomized Algorithm for String Matching with Mismatches.
Nord. J. Comput., 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

On the Length of the Minimum Solution of Word Equations in One Variable.
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

A Method of Extracting Related Words Using Standardized Mutual Information.
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.
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

Mining from Literary Texts: Pattern Discovery and Similarity Computation.
Proceedings of the Progress in Discovery Science, 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

Musical Sequence Comparison for Melodic and Rhythmic Similarities.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
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.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

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

Faster Approximate String Matching over Compressed Text.
Proceedings of the Data Compression Conference, 2001

Compressed Pattern Matching for SEQUITUR.
Proceedings of the Data Compression Conference, 2001

String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Multiple Pattern Matching Algorithms on Collage System.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Discovery Characteristic Patterns from Collections of Classical Japanese Poems.
New Generation Comput., 2000

Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Online Construction of Subsequence Automata for Multiple Texts.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
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.
Proceedings of the Discovery Science, 2000

A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Speeding Up Pattern Matching by Text Compression.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
A Unifying Framework for Compressed Pattern Matching.
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.
Proceedings of the Discovery Science, 1999

Pattern Matching in Text Compressed by Using Antidictionaries.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Shift-And Approach to Pattern Matching in LZW Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Discovering Characteristic Patterns from Collections of Classical Japanese Poems.
Proceedings of the Discovery Science, 1998

Multiple Pattern Matching in LZW Compressed Text.
Proceedings of the Data Compression Conference, 1998

1997
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1993
A Fast String-Searching Algorithm for Multiple Patterns.
Inf. Process. Manag., 1993


  Loading...