Search PubMed⌕ Search

PubMed · 15982427

Aggressive management of dengue shock syndrome may decrease mortality rate: a suggested protocol.

Abstract

OBJECTIVES: Dengue shock syndrome is a leading cause of mortality among Indian children. In January 2000, we instituted a protocol for aggressive management of children with dengue shock syndrome. The objective of this study was to compare outcomes (duration of ventilation, pediatric intensive care unit stay, incidence of acute respiratory distress syndrome, and intensive care unit and hospital mortality) before and after the protocol. DESIGN: Retrospective chart review. SETTING: Pediatric intensive care unit at a tertiary teaching hospital. PATIENTS: One hundred and fourteen patients admitted between July 1997 and December 1999 received standard therapy recommended by the World Health Organization (WHO) and were designated as the WHO guidelines group (W), whereas 96 patients admitted between January 2000 and December 2001 were treated by our protocol and designated as the protocol group (P). INTERVENTIONS: None. MEASUREMENTS AND MAIN RESULTS: The patients in each group were equally matched in terms of age, Pediatric Risk of Mortality, and number with dengue hemorrhage fever grade IV, although the platelet counts were higher in the W group compared with the P group (geometric mean 42.2, confidence interval 36.9, 48.4 vs. geometric mean 36.7, confidence interval 33.3, 40.5, p < .05). Patients in the W group received less fluids in the first hour compared with the P group (median and interquartile range 20 mL/kg, 15 and 20 vs. 30 mL/kg, 20 and 60). Fluid was actively removed less often in the W group than the P group (6 of 111 vs. 45 of 96, p < .05). There was no difference in the need for ventilation or incidence of acute respiratory distress syndrome between groups, although among dengue hemorrhage fever grade IV patients, the number requiring ventilation (17 of 30 vs. 20 of 23, p < .05) and the incidence of acute respiratory distress syndrome (9 of 30 vs. 17 of 23, p < .05) were significantly greater in the W group compared with the P group. The duration of ventilation (1.5 +/- 1.7 vs. 4.2 +/- 2.9 days, p < .05) and length of intensive care unit stay (3.0 +/- 2.8 vs. 3.4 +/- 2.9 days, p < .05) were significantly less in the W group. The pediatric intensive care unit mortality (16.6% vs. 6.3%, p < .05) was significantly higher in the W group than in the P group. CONCLUSIONS: Patients with dengue shock syndrome are at high risk of mortality due to refractory shock and multiple organ failure. Survival was better for patients in the P group. Aggressive shock management and possibly the use of judicious fluid removal may decrease mortality rates in the severest forms of dengue shock syndrome.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suchitra Ranjit, Niranjan Kissoon, Indira Jayakumar. 2005. Aggressive management of dengue shock syndrome may decrease mortality rate: a suggested protocol.. https://doi.org/10.1097/01.pcc.0000163676.75693.bf

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↗