I guess you could consider one algorithm to output the prediction and its covariance matrix, one algorithm to output the measurement (in the Kalman filter sense) and its covariance matrix.
To be more accurate, in the formalism found here one algorithm gives you $\hat{X}_{k|k-1}$ and $\hat{P}_{k|k-1}$ and the other gives you $z_k$ and $R_k$.
Then the update would look something like that :
$$X_{k|k} = \hat{X}_{k|k-1}+\hat{P}_{k|k-1}(\hat{P}_{k|k-1}+R_k)^{-1}(z_k-\hat{X}_{k|k})$$
That's how I'd go at least. Off course here this works if all your algorithm output noises are Gaussian. This happens if your manipulations from your data are linear and your data has Gaussian noise (if you do something linear to a Gaussian vector, it remains a Gaussian vector).
Although I'm no Kalman expert, I'm not sure you absolutely have to have a Gaussian vector for the noise of the prediction. But if your data has considerable outliers the vanilla Kalman filter will diverge.