The following pages link to Kazuyuki Narisawa (Q491145):
Displaying 14 items.
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← 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)
- Dynamic Edit Distance Table under a General Weighted Cost Function (Q3401114) (← links)
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays (Q3506935) (← links)
- Position Heaps for Parameterized Strings (Q5110872) (← links)
- Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data (Q5135244) (← links)