Efficient similarity measure for comparing tree structures

Souam, Fatiha; Hadj, Ali Ait El

doi:10.1504/ijaip.2016.074779

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The hierarchical relationships are thus ignored or suppressed and tree structures then behave like sequential data structures. [1] proposes an approach which relies on two types of traversal algorithm, namely the depth-first traversal and breadth-first traversal. The strategy aims to exploit the advantages of combining the two types of algorithms.…”

Section: Related Workmentioning

confidence: 99%

Quick and Efficient Algorithm to Compare Trees

Sowjanya¹,

V.²

2021

JUSST

View full text Add to dashboard Cite

The tree is an important data structure in computer science and it finds its applications in various fields right from representing hierarchical data to implementing faster search algorithms or even in compiler design. This paper proposes a simple method to visualize the differences and similarities between any two trees. The result of the comparison is known as the Difference Tree which provides a graphical notation to intuitively understand the differences.

show abstract

Section: Related Workmentioning

confidence: 99%