• TAUCS

  • Referenced in 31 articles [sw04014]
  • fill ordering of tree-structured matrices. All of these are symmetric orderings. Matrix Operations. Matrix ... read and write sparse matrices using a simple file format with one line per nonzero...
  • PhyloNetwork

  • Referenced in 27 articles [sw28216]
  • wide range of algorithms on phylogenetic trees, there exist only a few applications to work ... between them or aligning them. Results: In order to improve this situation, we have developed ... package and allows the user to make simple experiments with phylogenetic networks without having...
  • BIONJ

  • Referenced in 29 articles [sw08301]
  • this node. Moreover, BIONJ uses a simple first-order model of the variances and covariances ... have been performed with 12-taxon model trees to determine BIONJ’s efficiency. When...
  • MPTP 0.2

  • Referenced in 43 articles [sw02589]
  • abstracting from the proof context) the first-order instances that were actually used. These features ... just a XSLT stylesheet translating the XML tree to the TPTP syntax. The problem creation ... refactoring. This situation suggests that even a simple inductive or deductive system trained on formal...
  • YATL

  • Referenced in 2 articles [sw22192]
  • Language, is a simple, portable, and human-readable syntax for ordered trees [11]. Adapted...
  • iSAM2

  • Referenced in 6 articles [sw34747]
  • matrix updates as simple editing operations on the Bayes tree and the conditional densities represented ... method to incrementally change the variable ordering which has a large effect on efficiency...
  • QPsimplex

  • Referenced in 3 articles [sw31751]
  • nodes of the search tree. In order to overcome this shortcoming, we reformulate the problem ... function. The perspective reformulation lends itself to simple coordinate descent and bisection algorithms utilizing...
  • Oflox

  • Referenced in 1 article [sw25450]
  • simple extension was added in order to support the description of feasible trees...
  • UnQL

  • Referenced in 9 articles [sw20018]
  • semistructured data and XML. We describe a simple and powerful query language based on pattern ... defined on XML trees. On cyclic data, structural recursion can be defined in two equivalent ... structural recursion can be expressed in first-order logic extended with transitive closure; its data...
  • FairShapley

  • Referenced in 5 articles [sw28215]
  • fair proportion index of phylogenetic trees have been frequently discussed as prioritization tools in conservation ... total phylogenetic diversity, allowing for a simple conservation criterion. While both indices have their specific ... turn our attention to the mere ranking order provided by either of the indices ... Shapley value for a phylogenetic tree of European amphibians and illustrate their differences. We then...
  • BioGAP

  • Referenced in 4 articles [sw08793]
  • evolutionary distance between genomes (in order to construct phylogenetic trees) can be tackled ... calculate with are beyond the limits of simple brute-force methods. In this talk...
  • JavaCOP

  • Referenced in 1 article [sw30241]
  • type systems for Java. JavaCOP provides a simple declarative language in which program constraints ... defined over a program’s abstract syntax tree. The JavaCOP compiler automatically enforces these constraints ... also includes a dataflow analysis API in order to support type systems which depend...
  • rtrie

  • Referenced in 0 articles [sw18478]
  • simple R-based implementation of a Trie (a.k.a. digital tree/radix tree/prefix tree) A trie, also ... tree and sometimes radix tree or prefix tree is a kind of search tree. This ... ordered tree data structure is used to store a dynamic set or associative array where...
  • VirtuaSchlieren

  • Referenced in 1 article [sw29131]
  • large number of light rays—in the order of tens of millions—are reconstructed ... screen plane. To this purpose, kd-tree search algorithms are implemented to retrieve the position ... center of each cell. The simple Gladstone–Dale and the Lorentz–Lorenz models are implemented...
  • CGAL

  • Referenced in 350 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CLIFFORD

  • Referenced in 78 articles [sw00131]
  • CLIFFORD performs various computations in Grass mann and...
  • CoCoA

  • Referenced in 618 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Coq

  • Referenced in 1776 articles [sw00161]
  • Coq is a formal proof management system. It...
  • FGb

  • Referenced in 240 articles [sw00286]
  • FGb/Gb libraryGb is a program (191 420 lines...
  • GAP

  • Referenced in 2829 articles [sw00320]
  • GAP is a system for computational discrete algebra...