• ape

  • Referenced in 55 articles [sw04569]
  • reading, writing, plotting, and manipulating phylogenetic trees, analyses of comparative data in a phylogenetic framework ... such as Mantel’s test, minimum spanning tree, generalized skyline plots, graphical exploration of phylogenetic...
  • spdep

  • Referenced in 33 articles [sw04578]
  • analysis, including regional aggregation by minimum spanning tree; a collection of tests for spatial autocorrelation...
  • GeoSteiner

  • Referenced in 22 articles [sw04320]
  • currently the fastest program to calculate Steiner trees. It has been used to solve problems ... code for finding minimum spanning trees in arbitrary hyper graphs, which was applied ... Tree Problem in the Plane, Minimum Spanning Tree Problem in Hyper graphs The code...
  • STXXL

  • Referenced in 17 articles [sw06824]
  • external memory algorithms for computing minimum spanning trees, connected components, breadth-first search decompositions, constructing...
  • PhySIC

  • Referenced in 8 articles [sw08376]
  • Contradiction). For k input trees spanning a set of n taxa, this method produces ... summarize consensual information of a set of trees and localize groups of taxa for which...
  • CNOP

  • Referenced in 7 articles [sw00139]
  • curve approximation, minimum cost reliability constrained spanning trees and the table layout problem...
  • SAPPER

  • Referenced in 5 articles [sw18894]
  • takes advantage of pre-generated random spanning trees and a carefully designed graph enumeration order...
  • FATTA

  • Referenced in 2 articles [sw22122]
  • FATTA: Full automatic time-span tree analyzer. We developed a music analysis system called ... full automatic time-span tree analyzer (FATTA), which analyzes a piece of music based ... previously developed an automatic time-span tree analyzer (ATTA), which can acquire a time-span ... stability of the time-span tree. Experimental results showed that the performance of FATTA outperformed...
  • sigma GTTM

  • Referenced in 2 articles [sw22132]
  • σGTTM III: Learning based Time-span Tree Generator based on PCFG. We propose an automatic ... analyzer for acquiring a time-span tree based on the generative theory of tonal music ... analyze them properly. We reformalized the time-span reduction in GTTM based on a statistical ... acquire the most probabilistic time-span tree. We applied leave-one-out cross validation using...
  • GIGA

  • Referenced in 3 articles [sw29606]
  • genomic age: namely, a reliable species tree spanning much of the tree of life...
  • gSkeletonClu

  • Referenced in 3 articles [sw30861]
  • Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration. Community detection ... network to its Core-Connected Maximal Spanning Tree (CCMST), the network clustering problem is converted...
  • mst_clustering

  • Referenced in 1 article [sw29188]
  • clustering: Clustering via Euclidean Minimum Spanning Trees. Scikit-learn style estimator for Minimum Spanning Tree ... based on a trimmed Euclidean Minimum Spanning Tree, can be useful in this case...
  • AS 13

  • Referenced in 2 articles [sw03909]
  • Algorithm AS 13. Minimum spanning tree...
  • RNACluster

  • Referenced in 2 articles [sw23124]
  • base pair distance, mountain distance, morphological distance, tree edit distance, string edit distance ... ensemble clustering using a minimum spanning tree (MST) based algorithm. RNACluster can be used...
  • MiSTree

  • Referenced in 1 article [sw30562]
  • package for constructing and analysing Minimum Spanning Trees. The minimum spanning tree (MST), a graph...
  • CciMST

  • Referenced in 1 article [sw31403]
  • clustering algorithm based on minimum spanning tree and cluster centers. The minimum spanning tree...
  • mcMST

  • Referenced in 1 article [sw29266]
  • Toolbox for the Multi-Criteria Minimum Spanning Tree Problem. Algorithms to approximate the Pareto-front ... multi-criteria minimum spanning tree problems. Additionally, a modular toolbox for the generation of multi...
  • AS 40

  • Referenced in 1 article [sw03907]
  • Algorithm AS 40. Updating a minimum spanning tree...
  • AS 14

  • Referenced in 1 article [sw03910]
  • Algorithm AS 14. Printing the minimum spanning tree...
  • pyvine

  • Referenced in 1 article [sw38439]
  • vine structure which maximizes the vine tree dependence, i.e., the sum of the absolute values ... edges using PRIM algorithm of minimum-spanning-tree in a sequential way. The maximum likelihood...