Few scholars may have worked in networking up to their undergraduate and then switched on to cloud computing in the Master degree. It is not the fault of the scholars, we have fluctuating mind and we work according to the latest trends and topics. During the last few years, cloud computing is at the peak due to its latest technologies like hadoop and mapreduce.
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.
|Stay Connected||It is also an important area for the thesis in computer science.|
|Honours/Masters by Coursework Thesis Coordinator||Big data storage allocation in Cloud computing The challenge to efficiently archive and manage data is intensifying with the enormous growth of data.|
|Minor research thesis (45cp, duration – two semesters)||The scope of this document is very narrow and deals only with certain features of thesis development that are unique to the field of Computer Science.|
|Order Your Custom Thesis Writing Now!||Shape analysis and spatio-temporal tracking of mesoscale eddies in the Miami isopycnic coordinate ocean model Zheng, Qinhe The study of virtual organization Ray, Sourish Application of difference-in-clustering for identification of oceanographic features Yancho, Jeffrey C. Conditional mapping in data mediation Ram, Prashant K.|
|Image Processing||Introduction If you are about to embark on the task of developing a Master's thesis in Computer Science, then this document may be of interest to you.|
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.
Analysis and comparison of the obtained results should conclude the work.Computer Science Thesis Topics There is a list below consists of computer science thesis topics. This list of computer science thesis topics has been divided into two categories namely computer science PhD thesis topics and computer science Masters thesis topics.
Automated verification of a computer system reliability model: a thesis in computer science / by Ryan Mark Robidoux. Sood, Vishal. Automatic tracking by visualization of mesoscale eddies in MICOM: a thesis in computer science / by Vishal Sood. Department of Mathematics & Computer Science Prof.
Dr. Christian Kastner Carnegie Mellon University Institute of Software Research Sebastian Erdweg, r-bridal.com Department of Mathematics & Computer Science. Pusch, Jonas: Variability-Aware Interpretation Bachelor thesis, University of Marburg, CONTENTS I Contents List of Figures III List of.
In-depth research and a master's thesis by Seidenberg master's students. 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 . Department of Computer Science Kingsbury Hall N • 33 Academic Way • Durham, NH Tel: • Fax: • Email: CS.