Severity: Warning
Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 176
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3122
Function: getPubMedXML
File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 316
Function: require_once
This algorithm aims at unifying and generalizing the algorithm for detecting all types of documented drug interactions such as drug-drug interactions, drug-disease interactions, drug-patient interactions (drug allergy) from patient profile information and drug-laboratory test interactions in real-time prescribing system. Ideally, the system should conform to the following criteria: (1) data independence; (2) software interconnectability; (3) knowledge expandability; (4) flexibility; and (5) computation resource efficiency. We propose a robust Structured Query Language (SQL) algorithm to detect drug interactions and drug allergy according to such criteria. We believe that this is the first public domain algorithm in SQL that could be easily implemented into most open-system prescribing software which support SQL language. The algorithm comprises two major stages: 'expand' and 'extract'. The former expands all information in the prescription with their synonyms, groups, or components. The latter extracts the documented interactions by inner-joining knowledge-base with two independent copies of the expanded prescription list simultaneously. Simulation study for speed performance indicates that this algorithm is well behaved, for the speed of computation does not grow faster than the growth in prescription size.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1016/s0169-2607(01)00156-0 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!