LinCoM: a graph theoretic approach for the production of Linear place fields in Complex Mazes
preprint
OA: closed
Abstract
Studies on spatial coding and episodic memory typically involve recordings of hippocampal place cell activity while rodents navigate in mazes. Linear place fields serve as reduced representations of the activity of place cells, revealing their spatial preference along the tracks of the maze. Sometimes, the experimental designs include complex mazes with irregular geometries and one or more decision points. Unfortunately, in such complex mazes, the production of linear place fields becomes a non-trivial problem. Here, I present a MATLAB toolbox which implements a graph-theoretic approach for the efficient production of linear place fields in a variety of complex mazes.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00