### Abstract

We consider the tree alignment distance problem between a tree and a regular tree language. The tree alignment distance is an alternative of the tree edit-distance, in which we construct an optimal alignment between two trees and compute its cost instead of directly computing the minimum-cost of tree edits. The alignment distance is crucial for understanding the structural similarity between trees. We, in particular, consider the following problem: given a tree t and a tree automaton recognizing a regular tree language L, find the most similar tree from L with respect to t under the tree alignment metric. Regular tree languages are commonly used in practice such as XML schema or bioinformatics. We propose an O(mn) time algorithm for computing the (ordered) alignment distance between t and L when the maximum degree of t and trees in L is bounded by a constant, and O(mn^{2}) time algorithm when the maximum degree of trees in L is not bounded, where m is the size of t and n is the size of a finite tree automaton for L. We also study the case where a tree is not necessarily ordered, and show that the time complexity remains O(mn) if the maximum degree is bounded and MAX SNP-hard otherwise.

Original language | English |
---|---|

Pages (from-to) | 127-137 |

Number of pages | 11 |

Journal | Theoretical Computer Science |

Volume | 787 |

DOIs | |

Publication status | Published - 2019 Oct 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*787*, 127-137. https://doi.org/10.1016/j.tcs.2019.06.022

}

*Theoretical Computer Science*, vol. 787, pp. 127-137. https://doi.org/10.1016/j.tcs.2019.06.022

**Alignment distance of regular tree languages.** / Han, Yo-Sub; Ko, Sang Ki.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Alignment distance of regular tree languages

AU - Han, Yo-Sub

AU - Ko, Sang Ki

PY - 2019/10/1

Y1 - 2019/10/1

N2 - We consider the tree alignment distance problem between a tree and a regular tree language. The tree alignment distance is an alternative of the tree edit-distance, in which we construct an optimal alignment between two trees and compute its cost instead of directly computing the minimum-cost of tree edits. The alignment distance is crucial for understanding the structural similarity between trees. We, in particular, consider the following problem: given a tree t and a tree automaton recognizing a regular tree language L, find the most similar tree from L with respect to t under the tree alignment metric. Regular tree languages are commonly used in practice such as XML schema or bioinformatics. We propose an O(mn) time algorithm for computing the (ordered) alignment distance between t and L when the maximum degree of t and trees in L is bounded by a constant, and O(mn2) time algorithm when the maximum degree of trees in L is not bounded, where m is the size of t and n is the size of a finite tree automaton for L. We also study the case where a tree is not necessarily ordered, and show that the time complexity remains O(mn) if the maximum degree is bounded and MAX SNP-hard otherwise.

AB - We consider the tree alignment distance problem between a tree and a regular tree language. The tree alignment distance is an alternative of the tree edit-distance, in which we construct an optimal alignment between two trees and compute its cost instead of directly computing the minimum-cost of tree edits. The alignment distance is crucial for understanding the structural similarity between trees. We, in particular, consider the following problem: given a tree t and a tree automaton recognizing a regular tree language L, find the most similar tree from L with respect to t under the tree alignment metric. Regular tree languages are commonly used in practice such as XML schema or bioinformatics. We propose an O(mn) time algorithm for computing the (ordered) alignment distance between t and L when the maximum degree of t and trees in L is bounded by a constant, and O(mn2) time algorithm when the maximum degree of trees in L is not bounded, where m is the size of t and n is the size of a finite tree automaton for L. We also study the case where a tree is not necessarily ordered, and show that the time complexity remains O(mn) if the maximum degree is bounded and MAX SNP-hard otherwise.

UR - http://www.scopus.com/inward/record.url?scp=85070659879&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070659879&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2019.06.022

DO - 10.1016/j.tcs.2019.06.022

M3 - Article

AN - SCOPUS:85070659879

VL - 787

SP - 127

EP - 137

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -