Weighted ternary trees as data structures for dendritic molecules. (c2001)

LAUR Repository

Show simple item record

dc.contributor.author Doughan, Dany I.
dc.date.accessioned 2011-10-13T12:11:42Z
dc.date.available 2011-10-13T12:11:42Z
dc.date.copyright 2001 en_US
dc.date.issued 2011-10-13
dc.date.submitted 2001-01-01
dc.identifier.uri http://hdl.handle.net/10725/767
dc.description Includes bibliographical references (leaves 18-19). en_US
dc.description.abstract This thesis describes the construction of dendritic molecules using weighted ternary trees where each node is a record that represents the different physical, chemical, and quantum mechanical constants of a given atom and each weighted edge represents the number of bonds that exist between two adjacent atoms. This approach for representing such molecules offers flexibility as to reconfiguring the tree structure in case of addition of a new level or creation of a new generation in the dendrimer. en_US
dc.language.iso en en_US
dc.subject Molecular structure -- Data processing en_US
dc.subject Macromolecules -- Structure en_US
dc.subject Molecules -- Structure en_US
dc.subject Molecular weights en_US
dc.title Weighted ternary trees as data structures for dendritic molecules. (c2001) en_US
dc.type Thesis en_US
dc.term.submitted Fall en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 199401160 en_US
dc.author.commembers Dr. Ahmad Kabbani
dc.author.commembers Dr. Issam Moghrabi
dc.author.woa RA en_US
dc.description.physdesc 1 bound copy: vi, 19 leaves; 30 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Ramzi Haraty
dc.identifier.doi https://doi.org/10.26756/th.2001.15 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account