Using transcription-based detectors to emulate the behaviour of sequential probability ratio-based concentration detectors
The sequential probability ratio test (SPRT) from statistics is known to have the least mean decision time compared to other sequential or fixed-time tests for given error rates. In some circumstances, cells need to make decisions accurately and quickly, therefore it has been suggested the SPRT may be used to understand the speed-accuracy tradeoff in cellular decision making. It is generally thought that in order for cells to make use of the SPRT, it is necessary to find biochemical circuits that can compute the log-likelihood ratio needed for the SPRT. However, this paper takes a different approach. We recognise that the high-level behaviour of the SPRT is defined by its positive detection or hit rate, and the computation of the log-likelihood ratio is just one way to realise this behaviour. In this paper, we will present a method which uses a transcription-based detector to emulate the hit rate of the SPRT without computing the exact log-likelihood ratio. We consider the problem of using a promoter with multiple binding sites to accurately and quickly detect whether the concentration of a transcription factor is above a target level. We show that it is possible to find binding and unbinding rates of the transcription factor to the promoter's binding sites so that the probability that the amount of mRNA produced will be higher than a threshold is approximately equal to the hit rate of the SPRT detector. Moreover, we show that the average time that this transcription-based detector needs to make a positive detection is less than or equal to that of the SPRT for a wide range of concentrations. We remark that the last statement does not contradict Wald's optimality result because our transcription-based detector uses an open-ended test.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Non-partitioned e-detectors for nonparametric sequential change detection
We study the problem of sequential change detection over a general class of probability distributions ($\mathcal P$), where both the pre-change and post-change distributions are unknown and belong to $\mathcal P$. We do …
Change DetectionFeasibility of Post-Editing Speech Transcriptions with a Mismatched Crowd
Manual correction of speech transcription can involve a selection from plausible transcriptions. Recent work has shown the feasibility of employing a mismatched crowd for speech transcription. However, it is yet to be es…
Automatic Detection of Everyday Social Behaviours and Environments from Verbatim Transcripts of Daily Conversations
Coding in social sciences is a process that involves the categorisation of qualitative or quantitative data in order to facilitate further analysis. Coding is usually a manual process that involves a lot of effort and ti…
TextNeRF: A Novel Scene-Text Image Synthesis Method based on Neural Radiance Fields
Acquiring large-scale well-annotated datasets is essential for training robust scene text detectors yet the process is often resource-intensive and time-consuming. While some efforts have been made to explore the syn…
Image GenerationNeRFText DetectionBridging the Gap: A Framework for Real-World Video Deepfake Detection via Social Network Compression Emulation
The growing presence of AI-generated videos on social networks poses new challenges for deepfake detection, as detectors trained under controlled conditions often fail to generalize to real-world scenarios. A key factor …
DeepFake Detection