Inexact tree pattern matching with 1-degree edit distance using finite automata
From MaRDI portal
Publication:2689648
DOI10.1016/j.dam.2023.01.003zbMath1506.68085OpenAlexW4320477283MaRDI QIDQ2689648
Eliška Šestáková, Jan Janoušek, Ondřej Guth
Publication date: 13 March 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.01.003
dynamic programmingfinite automaton1-degree edit distanceapproximate tree pattern matchinginexact tree pattern matching
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Cites Work