PubMed Health⌕ Search

PubMed · 12930496

Adaptive pacing during ventricular fibrillation.

Abstract

While it has been shown that pacing during ventricular fibrillation (VF) can capture a portion of the epicardium, little is known about the characteristics of the area captured or about whether adaptively changing the pacing rate during VF will increase the area captured. In six open-chested pigs, pacing during VF was performed from the center of a plaque containing 504 electrodes 2 mm apart in a21 x 24 array on the anterior right ventricle. Simultaneous recordings from the 504 electrodes were used to construct activation maps from which the area of epicardium captured by pacing was determined. Four pacing algorithms were examined: (1) fixed rate pacing at 95% of the median VF activation rate, (2 and 3) adaptive pacing in which the pacing timing and/or rate is reset in real time if capture is not obtained, and (4) pacing at a slowly increasing rate after initial capture. Regional capture, defined as control of the myocardium under at least 10 plaque electrodes, was achieved in 71% (92/129) of pacing episodes. The incidence of capture was not significantly different for pacing algorithms 1-3. The maximum area captured for each pacing episode with algorithms 1-3 was 3.8 +/- 2.0 cm2(mean +/- SD). Within each animal, the pattern of capture was similar among all pacing episodes, no matter which algorithm was use dr = 0.85 +/- 0.25). The region of greatest capture extended away from the pacing site along the long axis of the myocardial fibers. However, the area of captured epicardium toward the right ventricular side of the pacing electrode was 9.7 times greater than toward the left ventricular side. This principal direction toward the right ventricular side of the pacing electrode was the same direction traveled by the majority of VF activation fronts before capture occurred. The absence of recorded activations at the pacing site for 20 consecutive stimuli predicted 83% of the time that regional capture was present. With algorithm 4, the pacing rate could be increased 7.1%+/- 4.3%while maintaining capture; however, the area of capture progressively decreased as the pacing rate increased. While pacing from the anterior right ventricular epicardium during VF, the area of capture is repeatable and is markedly asymmetrical with almost 10 times as much epicardium captured on the side of the pacing electrode closest to the acute margin of the right ventricle as on the opposite side. This marked asymmetry is associated both with myofiber orientation and with the direction of spread of activation and hence the direction of dispersion of refractoriness during VF just before pacing is initiated. It is possible to perform adaptive pacing algorithms in real time during VF; however, the two adaptive algorithms tested did not capture significantly more epicardium than a simple fixed-rate pacing algorithm. Although it is possible to maintain capture while increasing the pacing rate during VF, the area of capture decreases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philip L Johnson, Jonathan C Newton, Dennis L Rollins, William M Smith, Raymond E Ideker. 2003. Adaptive pacing during ventricular fibrillation.. https://doi.org/10.1046/j.1460-9592.2003.t01-1-00276.x

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↗