Some graph algorithms for molecular switching devices

Hossain, Mohammad Monowar (2006) Some graph algorithms for molecular switching devices. Masters thesis, Memorial University of Newfoundland.

[img] [English] PDF - Accepted Version
Available under License - The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.

Download (2290Kb)

Abstract

Molecular computing is a promising area for researchers from several disciplines. Currently many theoretical and application-oriented scientists are turning towards molecular computing with the goal to develop a molecular computer. Digital circuits for molecular devices are designed at the molecular level. A digital circuit will be thousands of times smaller if we can develop switching elements from appropriate molecules by using a direct chemical procedure. To develop such circuits we need to understand the nature of molecular switching in principle. The concept soliton automaton has been introduced to model this phenomena using graph matchings. The goal of my thesis was to develop and implement graph algorithms for soliton automata.

Item Type: Thesis (Masters)
URI: http://research.library.mun.ca/id/eprint/10683
Item ID: 10683
Additional Information: Includes bibliographical references (leaves 76-80).
Department(s): Science, Faculty of > Computer Science
Date: 2006
Date Type: Submission
Library of Congress Subject Heading: Algorithms; Graph theory; Molecular computers; Solitons.

Actions (login required)

View Item View Item

Downloads

Downloads per month over the past year

View more statistics