Detecting Non-Overlapping Signals with Dynamic Programming

. 2023 Jan 30;25(2):250. doi: 10.3390/e25020250

Algorithm 1: Signal detection using dynamic programming.

Input:
$y \in R^{N}$ , $x \in R^{L}$ , and the number of signal occurrences K
1:
for $k = 1$ to K do
2:
for $i = 1$ to N do
3:
compute $g [i, k]$ according to (5)
4:
end for
5:
end for
6:
return $g [N, K]$ and estimates of the locations of the signal occurrences ${\hat{n}}_{1}, \dots {\hat{n}}_{K}$