Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An improvement of the Aho-Corasick machine

From MaRDI portal
Publication:1818793
Jump to:navigation, search

DOI10.1016/S0020-0255(98)00018-8zbMath0951.68182OpenAlexW2171653073MaRDI QIDQ1818793

Jun-ichi Aoe, Kazuaki Ando, Masami Shishibori, Toshiharu Kinoshita

Publication date: 18 December 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(98)00018-8


zbMATH Keywords

string pattern matching machine


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)


Related Items

Efficient processing of substring match queries with inverted variable-length gram indexes ⋮ A sentence classification technique using intention association expressions



Cites Work

  • A relational theory of computing
  • A Method for Improving String Pattern Matching Machines
  • A fast string searching algorithm
  • Efficient string matching
  • Fast Pattern Matching in Strings
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1818793&oldid=14179715"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki