H 1 ∈ C N r × N s, H 2 ∈ C N d × N s, H 3 ∈ C N e × N s, H 4 ∈ C N d × N r, and H 5 ∈ C N e × N r are the complex-valued channel gain matrices as depicted in Figure 1.
The NJ algorithm was then applied to the three matrices and the resulting trees were compared to the true tree (as depicted by the appropriate LTP subtree) according to the RF distance.
Three observation probability matrices are generated corresponding to three HMMs which are combined into a single matrix Ocomb as depicted in Fig. 4.
Initially, we represent the subject-user bipartite graph as a binary matrix SU, as depicted in Figure 2(b).
The data path of the PC matrix computation, as depicted in Fig. 9, consists of a subtractor, a multiplier, and an accumulator.
(TXT 5 MB) 13321_2014_584_MOESM3_ESM.zip Additional file 3: Directory containing the source code of the algorithm described above and that allows to compute a similarity matrix such as depicted in Figure 3.
Here FIB-SEM was used to study the spatial distribution of the MOF filler in the MMMs as well as a mean to quantify the contact between the filler and the matrix phases, as depicted in Fig. 9.
Since all of the wild-type and mutant carriers lack a raised baseline fluorescence in the absence of ADP and BKA (Fig. S1), they are most likely in the cytoplasmic state, indicating that the substrate-free cytoplasmic state has a lower energy level than the substrate-free matrix state, as depicted in Fig. 6.
For example, the SNP-combinations (BB, AA) and (BB, AB) contain the attributes (BB, BB) and (BB, AB) as depicted in Matrix 2. The rank of a single attribute is the maximum of its cluster tree distances that satisfy the equivalence relation.
