AUB ScholarWorks

Algorithms for the comparison of unordered labeled trees - by Nagi Hanna Nahas

Algorithms for the comparison of unordered labeled trees - by Nagi Hanna Nahas

Nahas, Nagi Hanna
URI: http://hdl.handle.net/10938/8007
Date: 2009

Abstract:

The algorithmic problem of determining the edit distance of unordered labeled tr ees has important applications in software engineering, pattern recognition, and other fields. We propose an approach based on structural information by general izing a publi

Description:

 
Thesis (M.E.)--American University of Beirut, Dept. of Electrical and Computer Engineering, 2009.;"Advisor : Dr. Louay Bazzi, Assistant Professor, Dept. of Electrical and Computer Engineering.--Member of Committee : Dr. Fadi Karameh, Assistant Professor,
 
Bibliography : leaves 25-26.
 

Show full item record

Files in this item

Blocked
Name: et-5210.pdf
Size: 444.9Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Search AUB ScholarWorks


Browse

My Account