Login / Signup

Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance.

Debarati DasJacob GilbertMohammadTaghi HajiaghayiTomasz KociumakaBarna SahaHamed Saleh
Published in: CoRR (2022)
Keyphrases
  • dynamic programming
  • optimal solution
  • similarity measure
  • k means
  • np hard
  • matching algorithm
  • feature selection
  • data structure
  • lower bound
  • simulated annealing