Nunchaku: Optimally partitioning data into piece-wise linear segments
preprint
OA: closed
CC-BY-4.0
Abstract
When analysing two-dimensional data sets, scientists are often interested in regions where one variable depends linearly on the other. Typically they use an ad hoc method to do so. Here we develop a statistically rigorous, Bayesian approach to infer the optimal partitioning of a data set into contiguous piece-wise linear segments. Our nunchaku algorithm is freely available. Focusing on microbial growth, we use nunchaku to identify the range of optical density where the density is linearly proportional to the number of cells and to automatically find the regions of exponential growth for both Escherichia coli and Saccharomyces cerevisiae . For budding yeast, we consequently are able to infer the Monod constant for growth on fructose. Our algorithm lends itself to automation and high throughput studies, increases reproducibility, and will facilitate data analysis for a broad range of scientists.
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
- unpaywall
- last seen: 2026-05-20T11:00:21.680559+00:00
License: CC-BY-4.0