Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language
AUTOR(ES)
Lovis, Christian
FONTE
American Medical Informatics Association
RESUMO
Objective: 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.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=61442Documentos Relacionados
- Kangaroo – A pattern-matching program for biological sequences
- The string of pearls pattern in dermoscopy of a chest papule,
- Graphical models and point pattern matching
- An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
- “String of pearls pattern”: report of three cases of non clear-cell acanthoma