The paper provides the formulation and the code for an efficient algorithm to solve lasso problems with multiple realizations and heteroskedastic noise. This method has a great potential impact on M/EEG data analysis. As noted by one Reviewer since the contribution is closely related to a previous work the paper migth be considered an incremental work more suitable for a poster presentation.