( en | de | ru )

 

Disambiguation of "Shinohara, Ayumi"

Author of the publication

copydeleteadd this publication to your clipboard
On-Line Construction of Compact Directed Acyclic Word Graphs.

, , , , , , and . CPM, volume 2089 of Lecture Notes in Computer Science, page 169-180. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ayumi Kawanishi

Kenichi Shinohara

 

Other publications of authors with the same name

Longest Common Subsequence in at Least k Length Order-isomorphic Substrings., , , , , , , , and . CoRR, (2016)Computing longest single-arm-gapped palindromes in a string., , , , and . CoRR, (2016)Ternary directed acyclic word graphs., , , and . Theor. Comput. Sci., 328 (1-2): 97-111 (2004)Parameterized DAWGs: Efficient constructions and bidirectional pattern searches., , , , , , , , and . Theor. Comput. Sci., (2022)Uniform characterizations of polynomial-query learnabilities., , , and . Theor. Comput. Sci., 292 (2): 377-385 (2003)Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints., , , and . SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 363-374. Springer, (2014)Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance., , and . SOFSEM, volume 3381 of Lecture Notes in Computer Science, page 380-384. Springer, (2005)Computing Longest Common Substring and All Palindromes from Compressed Strings., , , , , and . SOFSEM, volume 4910 of Lecture Notes in Computer Science, page 364-375. Springer, (2008)Discovering Best Variable-Length-Don't-Care Patterns., , , , and . Discovery Science, volume 2534 of Lecture Notes in Computer Science, page 86-97. Springer, (2002)Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance., , , , , , and . Discovery Science, volume 3245 of Lecture Notes in Computer Science, page 32-46. Springer, (2004)