We study the problem of sparse reconstruction from noisy undersampled measurements when the following knowledge is available. (1) We are given partial, and partly erroneous, knowledge of the signal's support, denoted by <i>T</i> . (2) We are also given an erroneous estimate of the signal values on <i>T</i>, denoted by (μ̂)<i>T</i> . In practice, both of these may be available from prior knowledge. Alternatively, in recursive reconstruction applications, like real-time dynamic MRI, one can use the support estimate and the signal value estimate from the previous time instant as <i>T</i> and (μ̂)<i>T</i>. In this paper, we introduce regularized modified basis pursuit denoising (BPDN) (reg-mod-BPDN) to solve this problem and obtain computable bounds on its reconstruction error. Reg-mod-BPDN tries to find the signal that is sparsest outside the set <i>T</i>, while being “close enough” to (μ̂)<i>T</i> on <i>T</i> and while satisfying the data constraint. Corresponding results for modified-BPDN and BPDN follow as direct corollaries. A second key contribution is an approach to obtain computable error bounds that hold without any sufficient conditions. This makes it easy to compare the bounds for the various approaches. Empirical reconstruction error comparisons with many existing approaches are also provided.