. 2014 Jul 2;2014:757068. doi: 10.1155/2014/757068

Table 2.

An example of calculation of the C _{λ_m} criterion calculated from the matrix of the introductory example cf Figure 1(a).

Matrix of common neighbors	$B = \begin{matrix} 2 & 0 & 0 & 3 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 3 & 0 & 3 & 3 \\ 2 & 0 & 0 & 3 & 0 & 0 \\ 0 & 0 & 3 & 0 & 3 & 3 \\ 0 & 0 & 3 & 0 & 3 & 3 \end{matrix}$

Parsimony level	λ ≥ 1	λ ≥ 2	λ ≥ 3

Binary matrices of common neighbors	$B = \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 1 & 0 & 1 & 1 \end{matrix}$	$B = \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 1 & 0 & 1 & 1 \end{matrix}$	$B = \begin{matrix} 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 1 & 0 & 1 & 1 \end{matrix}$

∑_i=1 ⁶‍∑_j=1 ⁵‍ \| b _i,j ^λ_m − b _i,j+1 ^λ_m\|	17	15	9
(calculus per line)	(3 + 2 + 3 + 3 + 3 + 3)	(3 + 0 + 3 + 3 + 3 + 3)	(0 + 0 + 3 + 0 + 3 + 3)

Sorted binary matrices	$B_{1}^{sor} = \begin{matrix} 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 \end{matrix}$	$B_{2}^{sor} = \begin{matrix} 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \end{matrix}$	$B_{3}^{sor} = \begin{matrix} 1 & 1 & 1 & 0 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 & 0 \\ 1 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \end{matrix}$

∑_i=1 ⁶‍∑_j=1 ⁵‍ \| (b _i,j ^λ_m)_sort − (b _i,j+1 ^λ_m)_sort\|	9	85	3
(calculus per line)	(1 + 1 + 2 + 2 + 2 + 1)	(1 + 1 + 2 + 2 + 2 + 0)	(1 + 1 + 11 + 0 + 0 + 0)

Criterion C _{λ_m}	C _{λ_m≥1} = 9/17 = 1.89	C _{λ_m≥2} = 8/15 = 1.88	C _{λ_m≥1} = 3/9 = 3.03