Fig. 2From: ECL: an exhaustive search tool for the identification of cross-linked peptides using whole databaseComputational complexity against different numbers of proteins. Three t values were used to plot Kojak’s computational complexity curves. Chen et al. [32] has the highest time complexity. When the number of proteins is small, ECL has smaller time complexity compared to Kojak. When the number of proteins is large, ECL has higher complexity than KojakBack to article page