Alignment distance of regular tree languages

Yo Sub Han, Sang Ki Ko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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(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 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 languageEnglish
Title of host publicationImplementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings
PublisherSpringer Verlag
Pages126-137
Number of pages12
Volume10329 LNCS
ISBN (Print)9783319601335
DOIs
Publication statusPublished - 2017 Jan 1
Event22nd International Conference on Implementation and Application of Automata, CIAA 2017 - Marne-la-Vallee, France
Duration: 2017 Jun 272017 Jun 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10329 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other22nd International Conference on Implementation and Application of Automata, CIAA 2017
CountryFrance
CityMarne-la-Vallee
Period17/6/2717/6/30

Fingerprint

Alignment
Maximum Degree
Bioinformatics
XML
Tree Automata
Language
Costs
XML Schema
Edit Distance
Structural Similarity
Computing
Finite Automata
Time Complexity

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Y. S., & Ko, S. K. (2017). Alignment distance of regular tree languages. In Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings (Vol. 10329 LNCS, pp. 126-137). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10329 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-60134-2_11
Han, Yo Sub ; Ko, Sang Ki. / Alignment distance of regular tree languages. Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings. Vol. 10329 LNCS Springer Verlag, 2017. pp. 126-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6469d4b061eb4896a1c28078d6250f67,
title = "Alignment distance of regular tree languages",
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(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 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.",
author = "Han, {Yo Sub} and Ko, {Sang Ki}",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-60134-2_11",
language = "English",
isbn = "9783319601335",
volume = "10329 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "126--137",
booktitle = "Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings",
address = "Germany",

}

Han, YS & Ko, SK 2017, Alignment distance of regular tree languages. in Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings. vol. 10329 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10329 LNCS, Springer Verlag, pp. 126-137, 22nd International Conference on Implementation and Application of Automata, CIAA 2017, Marne-la-Vallee, France, 17/6/27. https://doi.org/10.1007/978-3-319-60134-2_11

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

Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings. Vol. 10329 LNCS Springer Verlag, 2017. p. 126-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10329 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Alignment distance of regular tree languages

AU - Han, Yo Sub

AU - Ko, Sang Ki

PY - 2017/1/1

Y1 - 2017/1/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 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 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=85021963467&partnerID=8YFLogxK

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

U2 - 10.1007/978-3-319-60134-2_11

DO - 10.1007/978-3-319-60134-2_11

M3 - Conference contribution

SN - 9783319601335

VL - 10329 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 126

EP - 137

BT - Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings

PB - Springer Verlag

ER -

Han YS, Ko SK. Alignment distance of regular tree languages. In Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Proceedings. Vol. 10329 LNCS. Springer Verlag. 2017. p. 126-137. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-60134-2_11