(Fast) Dynamic Time Warping

dtw alternatives and similar packages

Based on the "Algorithms" category

• arithmoi

  9.4 8.7 dtw VS arithmoi

  Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

• build

  9.4 7.8 dtw VS build

  Build systems a la carte

• toysolver

  9.1 7.8 dtw VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.4 dtw VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.8 3.3 dtw VS iproute

  IP Routing Table

• primes

  8.3 0.0 dtw VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 dtw VS graphs

  A simple monadic graph library

• funsat

  8.1 0.0 dtw VS funsat

  A modern DPLL-style SAT solver

• HMM

  7.9 0.0 dtw VS HMM

  A hidden markov model library

• imj-animation

  7.8 0.4 dtw VS imj-animation

  Animation Framework

• union-find

  7.8 0.0 dtw VS union-find

  Efficient union and equivalence testing of sets.

• aeson-diff

  7.8 2.4 dtw VS aeson-diff

  Extract and apply patches to JSON documents.

• presburger

  7.4 0.4 dtw VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 dtw VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 dtw VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 dtw VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 dtw VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• treeviz

  6.3 0.0 dtw VS treeviz

  Visualization of computation decomposition trees.

• qchas

  6.2 0.3 dtw VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 dtw VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 dtw VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 dtw VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• search-algorithms

  5.0 0.0 dtw VS search-algorithms

  Common graph search algorithms

• cmaes

  5.0 0.0 L1 dtw VS cmaes

  CMA-ES wrapper in Haskell

• integer-logarithms

  4.8 3.6 dtw VS integer-logarithms

  Integer logarithms.

• sgd

  4.8 7.0 dtw VS sgd

  Stochastic gradient descent

• edit-distance-vector

  4.8 0.0 dtw VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• binary-search

  4.6 0.0 dtw VS binary-search

  Binary and exponential searches

• TrieMap

  4.3 0.0 dtw VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• primesieve

  4.3 1.9 dtw VS primesieve

  FFI bindings for the primesieve library.

• union-find-array

  4.3 0.0 dtw VS union-find-array

  union find data structure

• KMP

  4.3 0.7 dtw VS KMP

  Knuth–Morris–Pratt string searching algorithm

• graph-generators

  4.1 0.0 dtw VS graph-generators

  Functions for generating structured or random FGL graphs

• infinite-search

  4.1 0.0 dtw VS infinite-search

  Exhaustively searchable infinite sets.

• DP

  4.1 0.0 dtw VS DP

  Pragmatic framework for dynamic programming

• jps

  3.8 0.0 dtw VS jps

  Jump point search for Haskell

• pathfinding

  3.8 0.0 dtw VS pathfinding

  pathfinding in grid and graphs

• spacefill

  3.5 0.0 dtw VS spacefill

  Generators for space-filling curves.

• nonlinear-optimization-ad

  3.5 0.0 dtw VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• edit-distance-linear

  3.1 7.1 dtw VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 dtw VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• epanet-haskell

  2.9 0.0 L2 dtw VS epanet-haskell

  Haskell binding for EPANET

• twentyseven

  2.9 0.0 dtw VS twentyseven

  Rubik's cube solver

• fibonacci

  2.9 0.0 dtw VS fibonacci

  Fast computation of Fibonacci numbers.

• pell

  2.5 0.0 dtw VS pell

  Package to solve the Generalized Pell Equation.

• stable-marriage

  2.5 0.0 dtw VS stable-marriage

  algorithms around stable marriage

• dgim

  2.5 0.0 dtw VS dgim

  Implementation of DGIM algorithm

• learning-hmm

  2.5 0.0 dtw VS learning-hmm

  Yet another library for hidden Markov models

• adp-multi

  2.1 0.0 dtw VS adp-multi

  ADP for multiple context-free languages

• ADPfusionSet

  1.1 0.0 dtw VS ADPfusionSet

  Dynamic programming for Set data structures.

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

Do you think we are missing an alternative of dtw or a related project?

Popular Comparisons

• dtw
  vs
  HMM
• dtw
  vs
  graph-generators
• dtw
  vs
  arithmoi
• dtw
  vs
  ADPfusionSet
• dtw
  vs
  twentyseven

SaaSHub - Software Alternatives and Reviews View more from us