The following pages link to Ayumi Shinohara (Q496551):
Displaying 46 items.
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions (Q674405) (← links)
- A machine discovery from amino acid sequences by decision trees over regular patterns (Q688817) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- Teachability in computational learning (Q749233) (← links)
- Compact directed acyclic word graphs for a sliding window (Q876704) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Enumeration of cryptarithms using deterministic finite automata (Q1616985) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- AC-automaton update algorithm for semi-dynamic dictionary matching (Q1796836) (← links)
- Uniform characterizations of polynomial-query learnabilities (Q1870533) (← links)
- A practical algorithm to find the best subsequence patterns (Q1870541) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Linear-time online algorithm for inferring the shortest path graph from a walk label (Q2297861) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- The size of subsequence automaton (Q2566019) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- (Q2723950) (← links)
- (Q2728909) (← links)
- Detecting Regularities on Grammar-Compressed Strings (Q2849944) (← links)
- Permuted Pattern Matching on Multi-track Strings (Q2927653) (← links)
- Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints (Q2938114) (← links)
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Compact bit encoding schemes for simply-typed lambda-terms (Q2982009) (← links)
- (Q3024794) (← links)
- (Q3024796) (← links)
- (Q3044513) (← links)
- (Q3126929) (← links)
- Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching (Q3297770) (← links)
- Position Heaps for Parameterized Strings (Q5110872) (← links)
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data (Q5135244) (← links)
- (Q5414581) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431305) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431307) (← links)
- Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences (Q5874440) (← links)
- In-place bijective burrows-wheeler transforms (Q5874450) (← links)
- DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures (Q5874456) (← links)
- Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences (Q6487606) (← links)
- Parallel algorithm for pattern matching problems under substring consistent equivalence relations (Q6496858) (← links)
