JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Nahas, Nagi Hanna |
| dc.date.accessioned | 2012-06-13T07:15:08Z |
| dc.date.available | 2012-06-13T07:15:08Z |
| dc.date.issued | 2009 |
| dc.identifier.uri | http://hdl.handle.net/10938/8007 |
| dc.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, |
| dc.description | Bibliography : leaves 25-26. |
| dc.description.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 |
| dc.format.extent | vii, 26 leaves : ill. 30 cm. |
| dc.language.iso | eng |
| dc.relation.ispartof | Theses, Dissertations, and Projects |
| dc.subject.classification | ET:005210 AUBNO |
| dc.subject.lcsh | Heuristic programming |
| dc.subject.lcsh | Algorithms |
| dc.title | Algorithms for the comparison of unordered labeled trees - by Nagi Hanna Nahas |
| dc.type | Thesis |
| dc.contributor.department | American University of Beirut. Faculty of Engineering and Architecture. Department of Electrical and Computer Engineering |
