Skip to main content
. 2003 Dec 12;100(26):15522–15527. doi: 10.1073/pnas.2136632100

Fig. 2.

Fig. 2.

A completely identifiable network (a) and an unidentifiable network (b). Although the two initial [A] matrices describing the network matrices have an identical number of constraints (zero entries), the network in b does not satisfy the identifiability conditions because of the connectivity pattern of R3. The edges in red are the differences between the two networks.