PubMed Health⌕ Search

PubMed · 16612290

A practical application of practice-based learning: development of an algorithm for empiric antibiotic coverage in ventilator-associated pneumonia.

Abstract

BACKGROUND: Development of practice-based learning (PBL) is one of the core competencies required for resident education by the Accreditation Council for Graduate Medical Education, and specialty organizations including the American College of Surgeons have formed task forces to understand and disseminate information on this important concept. However, translating this concept into daily practice may be difficult. Our goal was to describe the successful application of PBL to patient care improvement with development of an algorithm for the empiric therapy of ventilator-associated pneumonia (VAP). METHODS: The algorithm development occurred in two phases. In phase 1, the microbiology and timing of VAP as diagnosed by bronchoalveolar lavage was reviewed over a 2-year period to allow for recognition of patterns of infection. In phase 2, based on these data, an algorithm for empiric antibiotic coverage that would ensure that the large majority of patients with VAP received adequate initial empiric therapy was developed and put into practice. The period of algorithm use was then examined to determine rate of adequate coverage and outcome. RESULTS: : In Phase 1, from January 1, 2000 to December 31 2001, 110 patients were diagnosed with VAP. Analysis of microbiology revealed a sharp increase in the recovery of nosocomial pathogens on postinjury day 7 (19% < day 7 versus 47% > or = day 7, p = 0.003). Adequate initial antibiotic coverage was seen in 74%. In Phase 2, an algorithm employing ampicillin- sulbactam for coverage of community- acquired pathogens before day 7 and cefipime for nosocomial coverage > or =day 7 was then employed from January 1, 2002 to December 31, 2003. Evaluation of 186 VAP cases during this interval revealed a similar distribution of nosocomial cases (13% < day 7 versus 64% > or = day 7, p < 0.0001). Empiric antibiotic therapy was adequate in 82% of cases or =day 7: overall accuracy improved to 83% (p = 0.05). Mortality from phase 1 to phase 2 trended toward a decrease (21% versus 13%, p = 0.1). CONCLUSIONS: Application of the concept of PBL allowed for identification of local patterns of infection and development of an institution specific treatment algorithm that resulted in >80% adequate initial empiric coverage for VAP with a trend toward decreased mortality. PBL allows for alteration in practice based on local patterns and outcomes and has the potential to improve patient care.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Preston R Miller, Matthew S Partrick, J Jason Hoth, J Wayne Meredith, Michael C Chang. 2006. A practical application of practice-based learning: development of an algorithm for empiric antibiotic coverage in ventilator-associated pneumonia.. https://doi.org/10.1097/01.ta.0000214650.92501.76

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗