• Isabelle/ZF

  • Referenced in 62 articles [sw04973]
  • Theorem. Isabelle/ZF also provides theories of lists, trees, etc., for formalizing computational notions. It supports ... inductive definitions of infinite-branching trees for any cardinality of branching. (ZF: Zermelo-Fraenkel...
  • Timbuk

  • Referenced in 46 articles [sw06351]
  • over Term Rewriting Systems and for manipulating Tree Automata (bottom-up non-deterministic finite tree ... fully new version of the tree automata completion engine used for reachability analysis. Older Timbuk ... Objective Caml functions for basic manipulation on Tree Automata, alphabets, terms, Term Rewriting Systems...
  • SPOT

  • Referenced in 78 articles [sw06347]
  • classical regression and analysis of variance techniques; tree-based models such as CART and random...
  • PAUP*

  • Referenced in 53 articles [sw07834]
  • software package for inference of evolutionary trees, for use in Macintosh, Windows, UNIX/VMS ... software package for the inference of evolutionary trees. In addition, the PAUP manual has proven...
  • BEAST

  • Referenced in 45 articles [sw12588]
  • evolutionary hypotheses without conditioning on a single tree topology. BEAST 2 uses Markov chain Monte ... Carlo (MCMC) to average over tree space, so that each tree is weighted proportional...
  • MUSCLE

  • Referenced in 71 articles [sw13193]
  • expectation score, and refinement using tree‐dependent restricted partitioning. The speed and accuracy of MUSCLE...
  • GADGET

  • Referenced in 44 articles [sw12701]
  • distributed memory. While both versions use a tree algorithm to compute gravitational forces, the serial ... special-purpose hardware GRAPE instead of the tree. Periodic boundary conditions are supported by means ... combines this with a scheme for dynamic tree updates. Due to its Lagrangian nature, GADGET...
  • CLOSET

  • Referenced in 50 articles [sw26986]
  • techniques: (1) applying a compressed, frequent pattern tree FP-tree structure for mining closed itemsets...
  • BlackHat

  • Referenced in 69 articles [sw10450]
  • calculation, it uses compact analytic formulæ for tree amplitudes for four-dimensional helicity states...
  • CMAR

  • Referenced in 49 articles [sw28406]
  • growth, constructs a class distribution-associated FP-tree, and mines large databases efficiently. Moreover ... applies a CR-tree structure to store and retrieve mined association rules efficiently, and prunes...
  • hlib

  • Referenced in 66 articles [sw04080]
  • support routines for the creation of cluster trees, visualization and numerical quadrature. This...
  • ANN

  • Referenced in 45 articles [sw09854]
  • different data structures, based on kd-trees and box-decomposition trees, and employs a couple...
  • mboost

  • Referenced in 61 articles [sw07331]
  • wise (penalised) least squares estimates or regression trees as base-learners for fitting generalized linear...
  • XGBoost

  • Referenced in 61 articles [sw21035]
  • Gradient Boosting framework. XGBoost provides a parallel tree boosting (also known as GBDT, GBM) that...
  • bnlearn

  • Referenced in 59 articles [sw08265]
  • independence tests. The Naive Bayes and the Tree-Augmented Naive Bayes (TAN) classifiers are also...
  • SMAC

  • Referenced in 59 articles [sw27215]
  • speed up both local search and tree search algorithms by orders of magnitude on certain...
  • ANTLR

  • Referenced in 57 articles [sw03062]
  • parser that can build and walk parse trees...
  • RAxML

  • Referenced in 35 articles [sw07716]
  • with maximum likelihood. Inference of large phylogenetic trees with statistical methods is computationally intensive ... recently introduced simple heuristics which yield accurate trees for synthetic as well as real data ... RAxML to infer a 10.000-taxon phylogenetic tree containing representative organisms from the three domains...
  • FeynCalc

  • Referenced in 56 articles [sw07022]
  • have used the program to calculate tree level diagrams as well...