PubMed Health⌕ Search

PubMed · 1617993

Prolonged ventilatory support after open-heart surgery.

Abstract

OBJECTIVES: To characterize the course of open-heart surgery patients who require prolonged (greater than 72 hrs) mechanical ventilation and to define the role and timing of tracheostomy. DESIGN: Retrospective review. SETTING: Cardiac surgery ICU and surgery wards at a university hospital. PATIENTS: All open-heart surgery patients during an 18-month period from January 1988 to July 1989 (n = 581). From this group, 58 patients (9.9%) required prolonged mechanical ventilation. INTERVENTIONS: Study patients (n = 58) were followed through the course of intubation and/or tracheostomy until they were extubated, left the hospital on ventilation, or died. MEASUREMENTS AND MAIN RESULTS: End-points for mortality and complications were determined. Overall mortality rate was 43% in the patients who required prolonged mechanical ventilation. Twenty-eight percent of the 58 patients died within the first 14 days. Of those patients who survived, 55% required an endotracheal tube only and were extubated in less than 14 days; 45% of the patients required tracheostomy. Of those patients who required tracheostomy, five (26%) were eventually extubated, seven (37%) remained mechanically ventilated, and seven (37%) died. The complication rate for endotracheal tubes was 65%; the complication rate for tracheostomy was 37%. CONCLUSIONS: Open-heart surgery patients requiring prolonged mechanical ventilation are a desperately ill subset of cardiac surgery patients. Those patients who survive are either extubated in less than 14 days or require prolonged mechanical ventilation beyond that point. In our opinion, patients should be given 1 wk to recover and one trial of weaning from the ventilator. If this approach fails, then they should undergo elective tracheostomy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J LoCicero, B McCann, M Massad, A W Joob. 1992. Prolonged ventilatory support after open-heart surgery.. https://doi.org/10.1097/00003246-199207000-00015

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× to 17.6× faster than POASTA, and 7.3× 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× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× 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↗