Each student will do one of the projects below during this course.
The projects are done on individual basis and will count for 25% of
the final grade. The project will be handed in through CampusNet (Assignments
for the course) on the last day
of the course at 15.00 at the latest (lesson 13).
The students can consult the teacher or each other on problems in their
projects, however, actual cooperation between students with the same project
is not allowed.
It is the aim of the teacher, that the students are spread evenly over the projects.
If a student has an idea to a project - perhaps something that the student must do in
connection with some other course, then talk to the teacher. Perhaps something
can be worked out.
The time allotted for a project is approximately half time for the rest of the course.
That translates into 50 hours approx.
Every project consists of the following parts.
- The program code itself. The code should be well commented so it is possible to
follow your thinking. The major data structures should also be explained (structure and purpose).
The code must given in as a plain text file.
- A document that describes the algorithm that you implemented, with strengths and weaknesses if any,
the expected input data format, and an analysis of the runtime for the algorithm. Runtime has been explained
in the course. Click for more on runtime and Big O.
The document/report should be in preferably PDF or Word document. It is considered unlikely that that
the report is less than 4 pages, but there is no set limitation.
The report is evaulated by quality, not by length. Some projects are naturally heavy in theory,
others have a more practical approach, and the report is expected to reflect that to some extent.
- Any data files if relevant.
- Last but not least a signed version of this statement
must be included. You can print it, sign it, and scan it at CBS, if you have no other option.
Freja, Maria A, Carina, Anne-Mette, Sandra, Maria T
- Random sequence generator
Hülya, Stefanie, Søren
- Text mining MEDLINE abstracts
- Shortest path in graph
- Perl beautifier
- K-means clustering
- Analysis of sorting
- Data mining in NCBI databases
- Score sequence data with a PSSM
- Searching for signals/motifs in sequences
Katrine, Emil, Kamilla, Bjarki, Kiril
- Data analysis
- k-nearest neighbor (k-NN) continuous variable estimation
- Read trimmer for Next-Generation-Sequencing data
- QT clustering
Mathias, Christina, Shane
- Artificial Neural Network
- Smith-Waterman alignment
- Gibbs sampling
Not yet assigned: