The following pages link to Hideo Bannai (Q313750):
Displaying 48 items.
- Closed factorization (Q313756) (← links)
- On the existence of tight relative 2-designs on binary Hamming association schemes (Q383342) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- Uniqueness of certain association schemes (Q932816) (← links)
- Shortest unique palindromic substring queries in optimal time (Q1642725) (← links)
- Computing abelian string regularities based on RLE (Q1642729) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Fast algorithm for extracting multiple unordered short motifs using bit operations (Q1857026) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- (Q4608599) (← links)
- Shortest Unique Substring Queries on Run-Length Encoded Strings (Q4608632) (← links)
- Fully Dynamic Data Structure for LCE Queries in Compressed Space (Q4608635) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Finding all maximal perfect haplotype blocks in linear time (Q5091735) (← links)
- Faster STR-IC-LCS Computation via RLE (Q5110885) (← links)
- (Q5110887) (← links)
- Tight bounds on the maximum number of shortest unique substrings (Q5110890) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- (Q5140763) (← links)
- Online LZ77 Parsing and Matching Statistics with RLBWTs (Q5140769) (← links)
- Faster Online Elastic Degenerate String Matching (Q5140772) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- (Q5140779) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction (Q5369533) (← links)
- Factorizing a String into Squares in Linear Time (Q5369562) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431307) (← links)
- Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences (Q5874440) (← links)
- DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures (Q5874456) (← links)
- An improved data structure for left-right maximal generic words problem (Q5875603) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- (Q6098771) (← links)
- (Q6098777) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Longest bordered and periodic subsequences (Q6161459) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
