Basic concepts of graph theory and computational complexity theory.Basic algorhitms: Exhaustive search, Greedy algorithms, Dynamic programming, Divide-and-conquer algorithms. Graph algorithms. Combinatorial pattern matching algorithms. Algorithms for solving problems in bioinformatics and computational biology: Exact/inexact string matching; Suffix trees; Edit distance; Longest common substring, shortest common superstring; DNA mapping and sequencing; Global and local sequence alignment; Block alignement; Motiv finding; Repeat finding; Gene prediction; Genome rearrangements; Protein sequencing and identification; Multiple string comparison; DNA arrays and microarrays; Evolutionary trees and phylogeny; Hierarchical and k-means clustering; Gene expression analysis; Complex graph/networks layout.