Skip to main content
. 2014 Mar 12;9(3):e90781. doi: 10.1371/journal.pone.0090781

Table 3. Algorithm 3: CaSPIAN given a known subnetwork.

Input: Inline graphic, Inline graphic, Inline graphic, Inline graphic, and Inline graphic
Output: Inline graphic
Initialization: Form Inline graphic and Inline graphic; set Inline graphic, Inline graphic, and Inline graphic
For Inline graphic do
Inline graphic Run SP for vector Inline graphic, sensing matrix Inline graphic, and sparsity Inline graphic
Inline graphic Form Inline graphic Inline graphic Inline graphic Inline graphic
End
Inline graphic Form Inline graphic
Inline graphic Form Inline graphic using Inline graphic and set Inline graphic
For Inline graphic do
Inline graphic Form Inline graphic and calculate Inline graphic
Inline graphic Form the F-statistic using Inline graphic and Inline graphic
If the F-statistic is greater than the critical value corresponding to Inline graphic
Then set Inline graphic
Else set Inline graphic
End
Return Inline graphic

The pseudocode corresponding to the CaSPIAN algorithm given a known subnetwork.