Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language | Zendy

Christian Lovis | Zendy; Robert Baud | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language

Author(s) -

Christian Lovis,

Robert Baud

Publication year - 2000

Publication title -

journal of the american medical informatics association

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.614

H-Index - 150

eISSN - 1527-974X

pISSN - 1067-5027

DOI - 10.1136/jamia.2000.0070378

Subject(s) - string searching algorithm , computer science , preprocessor , commentz walter algorithm , algorithm , pattern matching , string (physics) , matching (statistics) , boyer–moore string search algorithm , approximate string matching , time complexity , theoretical computer science , artificial intelligence , mathematics , statistics , mathematical physics

The authors consider the problem of exact string pattern matching using algorithms that do not require any preprocessing. To choose the most appropriate algorithm, distinctive features of the medical language must be taken into account. The characteristics of medical language are emphasized in this regard, the best algorithm of those reviewed is proposed, and detailed evaluations of time complexity for processing medical texts are provided.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research