Sulaiman Alhassan, Alaa Abu Sayf, Camelia Arsene, Hicham Krayem
{"title":"在疑似肺栓塞患者中,诊断算法的实施效果不佳,以及过度使用计算机断层扫描-肺血管造影术。","authors":"Sulaiman Alhassan, Alaa Abu Sayf, Camelia Arsene, Hicham Krayem","doi":"10.4103/1817-1737.191875","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>Majority of our computed tomography-pulmonary angiography (CTPA) scans report negative findings. We hypothesized that suboptimal reliance on diagnostic algorithms contributes to apparent overuse of this test.</p><p><strong>Methods: </strong>A retrospective review was performed on 2031 CTPA cases in a large hospital system. Investigators retrospectively calculated pretest probability (PTP). Use of CTPA was considered as inappropriate when it was ordered for patients with low PTP without checking D-dimer (DD) or following negative DD.</p><p><strong>Results: </strong>Among the 2031 cases, pulmonary embolism (PE) was found in 7.4% (151 cases). About 1784 patients (88%) were considered \"PE unlikely\" based on Wells score. Out of those patients, 1084 cases (61%) did not have DD test prior to CTPA. In addition, 78 patients with negative DD underwent unnecessary CTPA; none of them had PE.</p><p><strong>Conclusions: </strong>The suboptimal implementation of PTP assessment tools can result in the overuse of CTPA, contributing to ineffective utilization of hospital resources, increased cost, and potential harm to patients.</p>","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":"19 1","pages":"254-260"},"PeriodicalIF":0.7000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5070434/pdf/","citationCount":"0","resultStr":"{\"title\":\"Suboptimal implementation of diagnostic algorithms and overuse of computed tomography-pulmonary angiography in patients with suspected pulmonary embolism.\",\"authors\":\"Sulaiman Alhassan, Alaa Abu Sayf, Camelia Arsene, Hicham Krayem\",\"doi\":\"10.4103/1817-1737.191875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Background: </strong>Majority of our computed tomography-pulmonary angiography (CTPA) scans report negative findings. We hypothesized that suboptimal reliance on diagnostic algorithms contributes to apparent overuse of this test.</p><p><strong>Methods: </strong>A retrospective review was performed on 2031 CTPA cases in a large hospital system. Investigators retrospectively calculated pretest probability (PTP). Use of CTPA was considered as inappropriate when it was ordered for patients with low PTP without checking D-dimer (DD) or following negative DD.</p><p><strong>Results: </strong>Among the 2031 cases, pulmonary embolism (PE) was found in 7.4% (151 cases). About 1784 patients (88%) were considered \\\"PE unlikely\\\" based on Wells score. Out of those patients, 1084 cases (61%) did not have DD test prior to CTPA. In addition, 78 patients with negative DD underwent unnecessary CTPA; none of them had PE.</p><p><strong>Conclusions: </strong>The suboptimal implementation of PTP assessment tools can result in the overuse of CTPA, contributing to ineffective utilization of hospital resources, increased cost, and potential harm to patients.</p>\",\"PeriodicalId\":51005,\"journal\":{\"name\":\"Computational Complexity\",\"volume\":\"19 1\",\"pages\":\"254-260\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5070434/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Complexity\",\"FirstCategoryId\":\"3\",\"ListUrlMain\":\"https://doi.org/10.4103/1817-1737.191875\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Complexity","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.4103/1817-1737.191875","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Suboptimal implementation of diagnostic algorithms and overuse of computed tomography-pulmonary angiography in patients with suspected pulmonary embolism.
Background: Majority of our computed tomography-pulmonary angiography (CTPA) scans report negative findings. We hypothesized that suboptimal reliance on diagnostic algorithms contributes to apparent overuse of this test.
Methods: A retrospective review was performed on 2031 CTPA cases in a large hospital system. Investigators retrospectively calculated pretest probability (PTP). Use of CTPA was considered as inappropriate when it was ordered for patients with low PTP without checking D-dimer (DD) or following negative DD.
Results: Among the 2031 cases, pulmonary embolism (PE) was found in 7.4% (151 cases). About 1784 patients (88%) were considered "PE unlikely" based on Wells score. Out of those patients, 1084 cases (61%) did not have DD test prior to CTPA. In addition, 78 patients with negative DD underwent unnecessary CTPA; none of them had PE.
Conclusions: The suboptimal implementation of PTP assessment tools can result in the overuse of CTPA, contributing to ineffective utilization of hospital resources, increased cost, and potential harm to patients.
期刊介绍:
computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format.
The central topics are:
Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results
for sequential and parallel computation
for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits)
for deterministic, probabilistic, and nondeterministic computation
worst case and average case
Specific areas of concentration include:
Structure of complexity classes (reductions, relativization questions, degrees, derandomization)
Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations)
Interactive proofs, pseudorandom generation, and randomness extraction
Complexity issues in:
crytography
learning theory
number theory
logic (complexity of logical theories, cost of decision procedures)
combinatorial optimization and approximate Solutions
distributed computing
property testing.