Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs   The unordered tree edit distance is a natural metric to compute distances
between trees without intrinsic child order, such as representations of
chemical molecules. While the unordered tree edit distance is MAX SNP-hard in
principle, it is feasible for small cases, e.g. via an A* algorithm.
Unfortunately, current heuristics for the A* algorithm assume unit costs for
deletions, insertions, and replacements, which limits our ability to inject
domain knowledge. In this paper, we present three novel heuristics for the A*
algorithm that work with custom cost functions. In experiments on two chemical
data sets, we show that custom costs make the A* computation faster and improve
the error of a 5-nearest neighbor regressor, predicting chemical properties. We
also show that, on these data, polynomial edit distances can achieve similar
results as the unordered tree edit distance.

33
The categories of this paper are: plasm-ph
34
The categories of this paper are: chem-ph
3
The categories of this paper are: physics
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex