• TED

  • Referenced in 10 articles [sw32694]
  • Java library TED: Tree edit distance. The Tree Edit Distance website is a reference place ... tree structured data using the tree edit distance (TED) measure. The tree edit distance...
  • DistMesh

  • Referenced in 310 articles [sw12766]
  • geometry is described implicitly by its distance function. In addition to being much shorter ... here is simplicity. Readers can download (and edit) the codes from http://math.mit.edu/ persson/mesh...
  • siEDM

  • Referenced in 3 articles [sw28064]
  • string index and search algorithm for edit distance with moves. Although several self-indexes ... editing operations remains a challenge. {it Edit distance with moves (EDM)} is a string ... string distance measure that includes substring moves in addition to ordinal editing operations to turn ... algorithm, named {it string index for edit distance with moves (siEDM)}, for indexing and searching...
  • Graph Matching Toolkit

  • Referenced in 2 articles [sw09487]
  • novel software toolkit for graph edit distance computation. Graph edit distance ... matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs ... functions. The computational complexity of graph edit distance, however, is exponential in the number ... powerful approximations for fast suboptimal graph edit distance computation. The contribution of the present work...
  • GEDEVO

  • Referenced in 3 articles [sw08298]
  • GEDEVO: an evolutionary graph edit distance algorithm for biological network alignment. With the so-called ... approach is the so-called graph edit distance (GED) model, where one graph...
  • RNACluster

  • Referenced in 2 articles [sw23124]
  • distance, mountain distance, morphological distance, tree edit distance, string edit distance and our in-house...
  • ViennaRNA

  • Referenced in 23 articles [sw10504]
  • several measures of distance (dissimilarities) using either string alignment or tree-editing (Shapiro & Zhang...
  • treex

  • Referenced in 3 articles [sw32686]
  • Approximation algorithms for unordered trees; (iv) Edit distance for unordered labeled trees; (v) Computation...
  • RNAspa

  • Referenced in 2 articles [sw17131]
  • very rapidly by a simple string Edit-Distance algorithm with a minimal loss of accuracy...
  • QOCA

  • Referenced in 30 articles [sw00756]
  • deleted, or values for designated “edit” variables may be suggested. Currently, QOCA supports linear arithmetic ... different metrics: the square of the Euclidean distance and Manhattan distance. It provides three solvers...
  • SlideSort

  • Referenced in 1 article [sw28786]
  • string pool in terms of edit distance. Using an efficient pattern growth algorithm, SlideSort discovers ... effective in reducing the number of edit distance calculations. In comparison to backtracking methods such...
  • SuMoTED

  • Referenced in 1 article [sw38888]
  • SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees. Defining and computing distances ... local move’ operation as an atomic edit of a tree ... then introduce SuMoTED, a new edit distance measure between such trees, defined as the minimal...
  • SimilarityMeasures

  • Referenced in 1 article [sw27386]
  • longest common subsequence (LCSS), Frechet distance, edit distance and dynamic time warping (DTW). Each...
  • NABEECO

  • Referenced in 1 article [sw08321]
  • solving the so-called Graph Edit Distance problem. Network Alignment is a computationally hard bioinformatics ... which has the lowest graph editing cost. Applied to Protein-Protein Interaction (PPI) networks, Network...
  • Simmetrics

  • Referenced in 1 article [sw33606]
  • Similarity Metric Library, e.g. from edit distance’s (Levenshtein, Gotoh, Jaro etc) to other metrics...
  • Malwise

  • Referenced in 1 article [sw20838]
  • based signatures amenable to the string edit distance. We use real and synthetic malware...
  • PAUP*

  • Referenced in 57 articles [sw07834]
  • With the inclusion of maximum likelihood and distance methods in PAUP* 4.0, the new version ... comparative biological analysis than were previous editions of the program and manual. PAUP...
  • stringdist

  • Referenced in 1 article [sw34013]
  • measures. Can calculate various string distances based on edits (Damerau-Levenshtein, Hamming, Levenshtein, optimal sting...
  • pyxDamerauLevenshtein

  • Referenced in 0 articles [sw39315]
  • pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high...
  • strgroup

  • Referenced in 0 articles [sw37473]
  • match strings based on their Levenshtein edit distance. strgroup matches similar strings together. This...