Detecting Non-Overlapping Signals with Dynamic Programming

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

Algorithm 2: Signal detection using the greedy approach.

Input:
$y \in R^{N}$ , $x \in R^{L}$ , and the number of signal occurrences K
1:
compute f according to (6)
2:
for $i = 1$ to K do
3:
${\hat{n}}_{i} = arg max f$ subject to $| {\hat{n}}_{i} - {\hat{n}}_{j} | \geq L$ for all $j < i$
4:
$γ_{K} [i] = max f$ subject to $| {\hat{n}}_{i} - {\hat{n}}_{j} | \geq L$ for all $j < i$
5:
end for
6:
$γ_{K} = \sum_{i = 1}^{K} γ_{K} [i]$
7:
return Estimates of the locations of the signal occurrences ${\hat{n}}_{1}, \dots {\hat{n}}_{K}$ , and $γ_{K}$