• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS BIL 4103 BIOINFORMATICS ELECTIVE 3 0 0 5

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR ÇAĞIN KANDEMIR ÇAVAŞ

Offered to

Computer Science

Course Objective

This course is aimed to introduce the basic introduction to bioinformatics and the techniques used for bioinformatics problems.

Learning Outcomes of the Course Unit

1   Have a good understanding of scope of the bioinformatics. 2   Have a good understanding of the protein structures. 3   Have a good understanding of the importance of classification and prediction on bioinformatics. 4   Have ability to make use of the algorithmic techniques to the bioinformatics problems. 5   Have a good understanding of computer-based approach for bioinformatics.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 What is Bioinformatics 2 Data Structure in Bioinformatics 3 Biological Database 4 Sequence Alignment-Global and Local Alignment 5 Scoring Matrices 6 Alignment Algorithms 7 Midterm exam 8 Alignment Algorithms (Continues to) 9 Basics of Phylogenetic Analysis 10 Algorithms of Phylogenetics Tree Construction 11 Algorithms of Phylogenetics Tree Construction (Continues to) 12 Algorithms of Phylogenetics Tree Construction (Continues to) 13 Protein structure identification algorithm 14 General review

Recomended or Required Reading

Textbook(s): S. Mitra, T. Acharya, Data Mining-Multimedia, Soft Computing and Bioinformatics, Wiley, 2003. Supplementary Book(s): I. Eidhammer, I. Jonassen, W.R. Taylor. Protein Bioinformatics, Wiley, 2004.

Planned Learning Activities and Teaching Methods

Lecture format, built around the textbook readings with numerous examples chosen to illustrate theoretical concepts.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 QUZ QUIZ 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + QUZ * 0.20 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + QUZ * 0.20 + RST * 0.50 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Midterm exam, Final exam and quizzes.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

cagin.kandemir@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparations before/after weekly lectures 12 3 36 Preparation for midterm exam 1 10 10 Preparation for final exam 1 30 30 Final 1 2 2 Midterm 1 2 2 Quiz etc. 2 1 2 TOTAL WORKLOAD (hours) 121

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 PO.13 LO.1 5 4 5 5 4 LO.2 5 4 5 5 3 LO.3 5 4 5 5 5 4 LO.4 5 5 5 5 4 4 5 LO.5 5 5