It is also an important area for the thesis in computer science. It has the following two main components: The structure of the words is identified and analyzed here. In this network, routing is initiated by a node that transfers the data packet to other nodes by following data routing algorithms.
In fact, this is often considered to be the most involved DNA manipulation process known in Nature! We focus in this project on a computational model for gene assembly consisting of only three rewriting rules describing the transformation of a micronuclear gene into a macronuclear gene.
This project would extend the currently existing Gene Assembly Simulator http: It would incorporate into the simulator the option to draw a directed graph and it would implement the simple gene assembly operations on directed graphs.
The student taking up this project would also design and implement graph algorithms for analyzing the computational power of the simple gene assembly operations.
One of the simplest such models is finite automata, representing an imaginary device with finite set of states. At every moment, this device can be in one of its states, and having obtained some input, it may change its state to another one.
Though this looks amazingly simple, many non-trivial results on these devices have been obtained. With respect to this project, finite automata are to be used in biological sequence comparison: The student will have to introduce the basic concept and some its important properties, as well as give historic information on biological sequence comparison and the methods used in attacking the problem.
An important part of the project is actual implementation of the algorithms. An implementation is expected to produce some interactive visual output, which might be used in learning purposes. Some comments on complexity of different methods are most welcome.
A brief discussion of the methods can be found at: Mikhail Barash Comparison of RNA secondary prediction approaches which are based on different families of formal grammars Last edited over 4 years ago RNA secondary structure prediction is one of the key questions in computational biology.
The problem appears to be computationally hard, and thus some approaches to tackle it have been studied. One of such approaches considers using methods of formal language theory, namely various kinds of grammar models.
The sequence is considered as a string which is then parsed according to a certain grammar and the properties of the sequence are concluded from the obtained parse tree.
The student will have to give an introduction to the formulation of the problem and explain its relevance from the point of view of theoretical computer science. Then the models, such as context-free grammars, tree-adjoining grammars, multi-component grammars, cover grammars, dependency grammars, and some others, alongside with their stochastic versions, are to be introduced.
After this, the student will have to discuss different kinds of issues arising with respect to the RNA secondary structure prediction, such as different kinds of loops and hairpins.
A programming part of the project assumes considering different grammar models and implementing them.In-depth research and a master's thesis by Seidenberg master's students. The 20 Best Graduate Programs in Computer Science—And How to Apply to Them.
The Cornell Department of Computer Science Master’s of Science and Ph.D. programs offer courses and research topics in areas such as database systems, security, graphics, robotics, and computer architecture, to name a few.
The master’s program entails. Thesis titles in Computer Science On this page you will find proposals for titles for theses both for Master of Science and Bachelor of Computer Science. Most of the titles are broad and suitable for both kinds of theses.
This thesis is submitted to the School of Computing at Blekinge Institute of Technology in partial ful lment of the requirements for the degree of Master of Science in Computer Science. College of Engineering / Computer Science / Academics / Graduate / Thesis & Dissertations List Thesis Defenses and Dissertations Please note that all links for this page are formatted as PDFs.
Before we get into the heart of the matter, you should ask yourself if you have the background and skills required to successfully complete a thesis in Computer Science. The next section lists some of the skills you will be expected to possess.