Fundamentals of Algorithms for Bioinformatics detailed syllabus for Biotechnology (BioTech) for 2021 regulation curriculum has been taken from the Anna Universities official website and presented for the BioTech students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.
For Biotechnology 7th Sem scheme and its subjects, do visit BioTech 7th Sem 2021 regulation scheme. For Professional Elective-VI scheme and its subjects refer to BioTech Professional Elective-VI syllabus scheme. The detailed syllabus of fundamentals of algorithms for bioinformatics is as follows.
Course Objectives:
Download the iStudy App for all syllabus and other updates.
Unit I
INTRODUCTION TO ALGORITHMS 9
Algorithms-Complexity of algorithms and running time, Polynomial, NP complete problems,Recursion, Linear, Exhaustive search, Branch and Bound, divide and conquer algorithms,Travelling sales man problem, sorting.
Unit II
DYNAMIC PROGRAMMING AND SEQUENCE BASED ALGORITHMS 9
Dynamic programming Principles and its uses. Local and Global alignment principles, Finding longest common subsequences, Heuristics second generation alignment tools for database searching : (Blast, FASTA, ClustalW), Statistical and Similarity based methods for gene prediction, Models of evolution.
Unit III
Download the iStudy App for all syllabus and other updates.
Unit IV
ARTIFICIAL NEURAL NETWORKS 9
Introduction to Artificial Neural Networks (ANN): A Simple Neuron, Firing rule,Network layers, Architectures of Artificial Neural Network: Feed-Forward networks,Feed-Back networks, Perceptrons, Pattern recognition problems, Back PropagationAlgorithm, Applications of Neural Networks.
Unit V
DNA AND RNA RELATED ALGORITHMS 9
Restriction enzyme mapping algorithms: algorithms for partial digest- double digest problem, Motif finding, Finding regulatory motifs in DNA, DNA computing, Genome alignment, Suffix Trees, RNA secondary structure prediction: Base pair maximisation and the Nussinov folding algorithm, Energy minimization and the Zuker folding algorithm, Design of covariance models, Application of RNA Fold.
Course Outcomes:
Upon completion of this course, Students will be able to
- Understand the basics of algorithms used in Bioinformatics.
- Apply dynamic programming in sequence analysis.
- Analyze the macromolecules using HMM, ANN and other related algorithms.
Text Books:
Download the iStudy App for all syllabus and other updates.
Reference Books:
- Neil C.JonesandPavel .A Pevzner An introduction to BioinformaticsAlgorthims.(computational Molecular Biology) (2004) MIT press. ISBN-10: 0262101068.
- R. Durbin, S.Eddy, A.Krogh, G.Mitchison Biological sequence analysis : Probabilisticmodels of Proteins and Nucleic acids (2005) Cambridge University Press 0521540798
- Michael.S.Waterman Introduction to Computational Biology : Maps, Sequences andGenomes . Waterman. Edition 2 (2012) Chapman and Hall/ CRC Press ISBN:1439861315
For detailed syllabus of all the other subjects of Biotechnology 7th Sem, visit BioTech 7th Sem subject syllabuses for 2021 regulation.
For all Biotechnology results, visit Anna University BioTech all semester results direct link.