Related Experiment Video
Updated: Feb 20, 2026

Author Spotlight: Optimizing CFPS Systems for Synthetic Cell Construction
Published on: April 19, 2024
zelll: a fast, framework-free, and flexible implementation of the cell lists algorithm for the Rust programming
Vincent Messow1, Christian Höner Zu Siederdissen2, Michael Habeck1,3
1Microscopic Image Analysis Group, Jena University Hospital, 07747 Jena, Germany.
Summary:
The cell lists algorithm is widely used to compute pairwise particle interactions below a fixed cutoff distance in approximately linear time. Prominent molecular dynamics frameworks implementing cell lists variants assume pre-determined and densely populated simulation boxes suitable for e.g. all-atom simulations with explicit solvents. zelll implements a simple yet efficient variant of the cell lists algorithm that uses sparse storage for the underlying partitioning grid. This allows for applications with dynamic simulation boundaries and sparsely populated simulation space not strictly fitting into the scope of common molecular dynamics frameworks, such as many coarse-grained simulations. For this reason, zelll does not target specific frameworks.
Availability And Implementation:
zelll is an open-source Rust library available under the MIT license at https://github.com/microscopic-image-analysis/zelll and https://crates.io/crates/zelll. Python bindings are available at https://pypi.org/project/zelll.
More Related Videos
Related Concept Videos
Assembly of Cytoskeletal Filaments
Statically Indeterminate Problem Solving
Adaptability of Cytoskeletal Filaments
Applications of Life Tables
Cell Lines
Replicative Cell Senescence

