Art
J-GLOBAL ID:201602207802660570   Reference number:16A0131457

Approximate String Matching Based on Extending Levenshtein Automata for Tries

Levenshteinオートマトンのトライへの拡張を元にした近似文字列マッチング
Author (3):
Material:
Volume: 99th  Page: 11-16  Publication year: Jan. 20, 2016 
JST Material Number: X0830A  ISSN: 2436-4584  Document type: Proceedings
Article type: 原著論文  Country of issue: Japan (JPN)  Language: ENGLISH (EN)
Thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

Semi thesaurus term:
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.

JST classification (3):
JST classification
Category name(code) classified by JST.
Automaton theory  ,  Basics of graph theory  ,  Symbol manipulation 
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page