Skip to main content
Figure 15 | Algorithms for Molecular Biology

Figure 15

From: Enumerating all maximal frequent subtrees in collections of phylogenetic trees

Figure 15

Scalability of MFSTMINER on dataset Q (2554 taxa) while varying the number of input trees. (a) Runtime comparison with 50 leaves in the input trees while varying the number of input trees from 100 to 1000. (b) Number of subtrees enumerated with 50 leaves in the input trees while varying the number of input trees from 100 to 1000. (c) Runtime comparison with 50 leaves in the input trees while varying the number of input trees from 2000 to 10000. (d) Number of subtrees enumerated with 50 leaves in the input trees while varying the number of input trees from 2000 to 10000. (e) Runtime comparison with 100 leaves in the input trees while varying the number of input trees from 100 to 1000. (f) Number of subtrees enumerated with 100 leaves in the input trees while varying the number of input trees from 100 to 1000. (g) Runtime comparison with 100 leaves in the input trees while varying the number of input trees from 2000 to 10000. (h) Number of subtrees enumerated with 100 leaves in the input trees while varying the number of input trees from 2000 to 10000. (i) Runtime comparison with 150 leaves in the input trees while varying the number of input trees from 100 to 1000. (j) Number of subtrees enumerated with 150 leaves in the input trees while varying the number of input trees from 100 to 1000. (k) Runtime comparison with 150 leaves in the input trees while varying the number of input trees from 2000 to 10000. (l) Number of subtrees enumerated with 150 leaves in the input trees while varying the number of input trees from 2000 to 10000.

Back to article page