Network Completion Using Dynamic Programming and Least-Squares Fitting

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td align="left">Experimental conditions </td><td align="center">Accuracy </td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td align="left">cdc15 </td><td align="center">11/25 </td></tr><tr><td align="left">cdc15 + cdc28 </td><td align="center">8/25 </td></tr><tr><td align="left">cdc15 + cdc28 + alpha </td><td align="center">8/25 </td></tr><tr><td align="left">cdc15 + cdc28 + alpha + elu </td><td align="center">11/25 </td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Result on inference of a yeast cell cycle network.

The Scientific World Journal

tab4

Table 4

Table 4: Network Completion Using Dynamic Programming and Least-Squares Fitting 