Computer Science MS; MS-Non Thesis The Department of Computer Science is a department with energetic and creative professors whose interests cover many of the growing or emerging research areas in computer science.
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.
In this thesis, the student will use Case Based Reasoning (CBR) to design and develop a recommender system for subject selection in higher education context. The research component of this project is the identification and validation of the CBR approach and its parameters for the recommendation system. 23 October We would like to inform you that you are now able to submit proposals under the third Short Time Scientific Missions (STSM) call, which foresees the implementation of up to 5 STSMs. In the Department of Computer Science, the number of thesis projects ranges from one to three students per year. To pursue a thesis, a student must maintain a certain grade point average and have a project approved by the department faculty.
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. Analysis and comparison of the obtained results should conclude the work.
The introductory material can be found in: Mitchison, Biological sequence analysis: Probabilistic models of proteins and nucleic acids, Cambridge University Press, In short, the problem is to predict the three dimensional folding of a given protein.
Find out what it really takes to get into the Ivy League with College Compass by Test Masters. This post discusses GPA and class rank. Aug 28, · Computer Science Topics List for Thesis, Research, and Project. Computer Science is the most popular and thriving field of study these days due to a large number of career opportunities in this field of study. THESIS TOPICS FOR COMPUTER SCIENCE STUDENTS. Thesis Topics for Computer Science Students is the need for many scholars today due to the fluctuating mind of young scholars. Few scholars may have worked in networking up to their undergraduate and then switched on to cloud computing in the Master degree.
Although our understanding of this folding is still limited, many models exist for this problem, combining various hypothesis and insights into the biochemistry of protein sequences with elegant algorithms on strings. This project would consider some of the existing computational models for protein folding and implement them efficiently.
Ideally, a visual output should be provided. Exact and local string matching simulator using reaction systems Last edited over 4 years ago Reaction systems is a framework developed based on the intuition behind chemical reactions. Every reaction system is represented by a set of reactions where each of them consists of three non-empty finite sets standing for the set of reactants, the set of inhibitors and the set of products.
Any reaction system considers two interesting assumptions: Here we aim to help building a bridge between a purely theoretical world and an extremely practical one. The goal of this thesis is to develop a tool which implements the exact and local string matching using this framework.
String matching is widely used in different fields. Few of the fields in which string matching plays an eminent role include information security, detecting plagiarism, text mining, etc.Many professions and many graduate and professional school programs regard a strong background in mathematics as highly desirable.
For that reason, students with a primary interest in other disciplines may also want to consider a major or minor in mathematics. Explore our graduate programs and create your own academic path.
[Not the most interesting topic in the world, but I’m posting it so I have something to link to next time I see this argument] I talk about superintelligence a lot, usually in . In this thesis, the student will use Case Based Reasoning (CBR) to design and develop a recommender system for subject selection in higher education context.
The research component of this project is the identification and validation of the CBR approach and its parameters for the recommendation system.
The student taking up this topic would give an introduction to the formulation of the P=NP problem and explain its relevance for theoretical and applied computer science.
The thesis would then present the ideas of some of the (failed) approaches that have been proposed for this problem. Jun 22, · Computer science technology becomes obsolete very fast and, if you do not choose something that is very new in the field, by the time you finish your thesis it will be, to all intents and purposes, about dinosaurs.