Skip to main content


Figure 9 | Algorithms for Molecular Biology

Figure 9

From: On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences

Figure 9

a) The runtimes shown in this figure are based on artificial data sets. Here, the maximal length is 100 and from all possible intervals a random set is chosen, ranging from 10% to 50% of all possible intervals. The time needed to compute all maximal cliques for all constraints from 0.05 to 0.95 is given in ms. b) gives the number of maximal cliques found in the data sets.

Back to article page