• ViennaRNA

  • Referenced in 22 articles [sw10504]
  • package contains several measures of distance (dissimilarities) using either string alignment or tree-editing (Shapiro...
  • ASSAM

  • Referenced in 6 articles [sw13842]
  • based on an ensemble of string distance metrics...
  • siEDM

  • Referenced in 3 articles [sw28064]
  • siEDM: an efficient string index and search algorithm for edit distance with moves. Although several ... moves (EDM)} is a string-to-string distance measure that includes substring moves in addition ... ordinal editing operations to turn one string into another. Although the problem of computing ... first algorithm, named {it string index for edit distance with moves (siEDM)}, for indexing...
  • RNACluster

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

  • Referenced in 1 article [sw34013]
  • String Matching, Fuzzy Text Search, and String Distance Functions. Implements an approximate string matching version ... fuzzy text search based on various string distance measures. Can calculate various string distances based...
  • Harry

  • Referenced in 1 article [sw15426]
  • over 20 similarity measures, including common string distances and string kernels, such as the Levenshtein ... distance and the Subsequence kernel. The tool has been designed with efficiency in mind ... analysis of large data sets of strings. Harry supports common data formats and thus...
  • CDNA

  • Referenced in 9 articles [sw37103]
  • reference string, and all matches are noted. That is, matches of Hamming distance...
  • RNAspa

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

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

  • Referenced in 0 articles [sw39315]
  • Vladimir I. Levenshtein) is a “distance” (string metric) between two strings, i.e., finite sequence ... Python implementation, which implements the optimal string alignment distance algorithm. It runs...
  • JavaPermutationTools

  • Referenced in 1 article [sw33216]
  • metrics as well as distance metrics on sequences (i.e., Strings, arrays, and other ordered data...
  • genieclust

  • Referenced in 1 article [sw39419]
  • speed, supports various distances over dense, sparse, and string data domains, and can be robustified...
  • strgroup

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

  • Referenced in 1 article [sw28786]
  • similar pairs from a string pool in terms of edit distance. Using an efficient pattern...
  • VeRi dataset

  • Referenced in 0 articles [sw33961]
  • plates, plate strings, the timestamps of vehicles, and the distances between neighbouring cameras...
  • RubiksCubeGeneticAlgorithmsSolver

  • Referenced in 1 article [sw38923]
  • efficiently applied when population individuals are strings. Changing randomly selected operation with another randomly selected ... evaluation a combination between Euclidean and Hausdorff distances is proposed in this research. The experiments...
  • CASA

  • Referenced in 102 articles [sw00108]
  • CASA is a special-purpose system for computational...
  • CoCoA

  • Referenced in 649 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • GAP

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

  • Referenced in 78 articles [sw00410]
  • HOM4PS-2.0: a software package for solving polynomial...