Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Dynamic arrays for fast, efficient, data manipulation during image analysis: a new software tool for exploratory data

E J Breen1, G H Joss, K L Williams

  • 1School of Biological Sciences, Macquarie University, Sydney, NSW, Australia.

Computer Methods and Programs in Biomedicine
|March 1, 1992
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Optimizing genomic prediction for Australian Red dairy cattle.

Journal of dairy science·2020
Same author

The genotype-phenotype landscape of familial amyotrophic lateral sclerosis in Australia.

Clinical genetics·2017
Same author

Precision of total and regional body fat estimates from dual-energy X-ray absorptiometer measurements.

The journal of nutrition, health & aging·2014
Same author

The mating system of the cellular slime mould Dictyostelium discoideum.

Current genetics·2013
Same author

Temperature-sensitive DNA repair mutations in the cellular slime mould Dictyostelium discoideum.

Current genetics·2013
Same author

Post-exercise cardiac troponin release is related to exercise training history.

International journal of sports medicine·2012
Same journal

SynTME: A tumor microenvironment-aware, pharmacology-inspired multi-stage framework for drug synergy prediction.

Computer methods and programs in biomedicine·2026
Same journal

MMFVS-Net: A triple-symmetric cross-attention network for multimodal optical image fusion and high-accuracy virtual staining of breast cancer tissues.

Computer methods and programs in biomedicine·2026
Same journal

A novel Milstein-stochastic epidemiologically-informed neural network for approaching epidemic dynamics: Application to Mpox disease.

Computer methods and programs in biomedicine·2026
Same journal

Accounting for approximation errors using surrogate-based parameter estimation of cardiac mechanics digital twins.

Computer methods and programs in biomedicine·2026
Same journal

Facial iPPG heatmap patterns based on period-aware autoencoder show association with carotid atherosclerosis towards non-contact hemodynamic assessment.

Computer methods and programs in biomedicine·2026
Same journal

Explainable machine learning models predict liver fibrosis risk and outcome in the general population: Development and multi-cohort external validation.

Computer methods and programs in biomedicine·2026
See all related articles

This study introduces a novel C programming language data structure for efficient run-time information storage. It utilizes dynamic memory and array indexing, avoiding complex pointers for faster data access.

Area of Science:

  • Computer Science
  • Data Structures
  • Algorithm Design

Background:

  • Efficient data storage is crucial for real-time data collection and analysis.
  • Traditional data structures often involve complex memory management with pointers, leading to potential inefficiencies.
  • Dynamic storage requirements necessitate flexible data structure solutions.

Purpose of the Study:

  • To present a novel run-time data structure for efficient information storage.
  • To develop a system that avoids pointer-based memory management for enhanced simplicity and speed.
  • To offer a flexible solution for dynamically competing storage needs.

Main Methods:

  • Development of a data structure using dynamic memory allocation in the C programming language.
  • Implementation of a management system comprising ANSI standard C subroutines.

Related Experiment Videos

  • Utilization of array indexing for data access, replacing traditional linked lists or trees.

    • Main Results:

    • A functional run-time data structure that efficiently stores information.
    • Elimination of the need for pointers in linking data nodes.
    • Simplified and efficient data retrieval through array indexing.
    • Demonstrated flexibility in handling dynamic storage demands.

    Conclusions:

    • The presented data structure offers a fast and efficient alternative for run-time information management.
    • The pointer-free design simplifies implementation and reduces potential errors.
    • Array-based access provides a more direct and performant method for data retrieval compared to list or tree structures.