An improved windowing technique for heart rate variability power spectrum estimation.

D Singh; K Vinod; S C Saxena; K K Deepak

doi:10.1080/03091900412331286378

Home/Archive/PubMed

PubMed · 15804859

An improved windowing technique for heart rate variability power spectrum estimation.

D Singh·K Vinod·S C Saxena·K K Deepak

View original source ↗Export metadata ↓

Abstract

Spectral analysis of heart rate variability (HRV) is an accepted method for assessment of cardiac autonomic function and its relationship to numerous disorders and diseases. Discrete Fourier transform (DFT) based methods are widely used for their easy applicability, computational speed and the possibility for direct interpretation of results. This study assesses the limitation of windowing of the RR interval series of power spectrum estimation using DFT for heart rate variability studies. The mean value of the RR interval series should be subtracted before windowing. This may leave a small residual DC component after windowing, but the RR interval series is properly tapered to zero at the beginning and end of the window. However, if the windowed RR interval series has a non-zero mean then subtracting this mean will create an abrupt transition between the first and last data points, and the padded zeros. This is equivalent to superimposing upon the RR interval series a rectangular pulse of the same length as the window, with a height equal to the subtracted mean value. In the present paper an approach to overcome the above effects of the window in reducing the signal energy and introducing the low frequency component into spectrum has been suggested and incorporated. Result have been compared for DC biasing of windowed data spectrum, bias of windowed data removed by substraction of mean data, and data processed to remove windowed mean level and to maintain mean power. Thus the preprocessing of RR interval series with this method improves the accuracy of HRV analysis methods. The study was carried out by smoothing the complete RR interval series by single Hann window and by 50% overlapping the data segments of 256 data points followed by the DFT. Overlapping the data segments provides equal weight to all values in the RR interval series and smoothed spectral estimate with clearly dominant peaks in low- and high-frequency regions.

Explore related subjects

Algorithms Diagnosis, Computer-Assisted Electrocardiography Fourier Analysis Heart Rate Humans Reproducibility of Results Sensitivity and Specificity Signal Processing, Computer-Assisted Comparative Study Evaluation Study Journal Article Research Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

D Singh, K Vinod, S C Saxena, K K Deepak. An improved windowing technique for heart rate variability power spectrum estimation.. https://doi.org/10.1080/03091900412331286378

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

KEEP EXPLORING

Related citations

PubMed2026

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↗

PubMed2026

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↗

PubMed2026

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↗