Reproduce “A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Bridget Smart, Max Ward, Matthew Roughan
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.