BINF G4013 Biological Sequence Analysis

Course Description: Biological sequence analysis (bioinformatics) is the study of the relationships between biological sequences and the implication of these relationships for macromolecular structure, function, and evolution. Bioinformatics is now a necessary part of the tools and training of all scientists who use molecular biological methods because they must process raw DNA sequences and assign structure and function to gene products. Bioinformatic methods are based on aspects of a variety of disciplines including computer science, probability, and molecular, structural, and evolutionary biology. The biomedical researcher must understand the computational and scientific basis of the programs he uses in order to use the programs correctly.

The purpose of this course is to train biomedical researchers, including those who may not yet be comfortable with computers, in bioinformatic methods. All of these methods center around the identification and classification of gene products and the elucidation of genome structure. The biological and informatic basis of all methods studied is covered, the methods are demonstrated in class, and the students run the programs themselves. The course covers both web-based and desktop-based programs.



Richard Friedman, PhD

Teaching Assistant

Yiwei Sun

Class Schedule

Wednesday 9-12 online
via Zoom
(1 hour lecture / 2 hours lab)

Prerequisites: There are no formal prerequisites. A basic background in molecular biology is assumed which can be made up by reading. If you think that you may not have an adequate background in molecular biology please let me know and I will send you a PowerPoint presentation and assign reading. No computer background beyond basic desktop usage is necessary. This semester the course is offered online. Requirements: Attendance is required, at the scheduled time of the lecture and lab. Each student is required to attain the primary objectives of each lab. There is homework. For CMBS 4020 is graded Pass/Fail and there will be no tests. For BINF 4013 is graded by a letter grade and there will be a final based upon the labs, lectures, reading, and homework. Required Text Bioinformatics and Functional Genomics, Third Edition, Jonathan Pevsner, Wiley-Liss 2015. This text is available from the publisher in either print or 2 electronic formats at It is also available in print form from various online booksellers. There are 2 websites accompanying the text. Their use is optional: and Course Schedule  1. Sequences and databases. Jan. 13 Read: Bioinformatics and Functional Genomics Chapters 1 and 2.
  1. File formats: Fasta, GCG, EMBL.
  2. Seqret (EMBOSS).
  3. Querying NCBI databases.
  4. NCBI GQuery Server.
2. Comparison of Sequences. Jan. 20 Read: Bioinformatics and Functional Genomics: Chapter 3.
  1. Graphical sequence comparison (Dotmatcher – EMBOSS).
  2. Needleman-Wunsch global sequence alignment (Needle – EMBOSS)
  3. Smith-Waterman local sequence alignment. (Water- EMBOSS).
  4. Comparing a DNA sequence with a protein sequence – Genewise.
3. Database searching by sequence. Jan. 27 Read:Bioinformatics and Functional Genomics Chapter 4.
  1. Use of the Blast World-Wide-Web interface.
  2. Interpretation of results, Karlin-Altschul theory and statistical significance
  3. The Blast algorithm.
  4. Filtering of low-complexity and repetitive sequences – Seg and Dust.
  5. The Fasta family of programs
  6. The Blast family of programs.
  7. Combining Blast and text string searches.
4. Multiple sequence alignment. Feb. 3 Read: Bioinformatics and Functional Genomics: p.205-222.
  1. Progressive pair-wise alignment.
  2. Evolutionarily-weighted progressive pairwise alignment: ClustalX.
  3. Interactive alignment with Clustalx.
  4. Display of multiple sequence alignments: Boxshade.
  5. Consistent alignments with T-Coffee.
  6. Meme: Probabilistic identification and alignment of short conserved regions.
5. Pattern and profile methods of identifying distant homologs Feb. 10 Read: Bioinformatics and Functional Genomics: p. 552-559, 171-186, 222-237. A. Prosite Patterns.      A1. The Prosite database (Web).      A2. Regular grammars.      A3. Combining motif and full sequences searches: Phiblast. B. Classical Profiles      B1. Theory of classical profiles.      B2. The Prosite Profile Database.      B3. The NCBI Conserved Domain Database.      B4. Automated iterative profile searching with Psiblast.      B5. Searching with a sets of short Profiles: Meme and Motifscan. C. Hidden Markov Models.      C1. Theory of hidden Markov Model profiles.      C2. The Pfam Hidden Markov Model Server.      C3. Other Profile databases.          C3a. Smart.          C3b Interpro      C4. The Web implementation of Hmmer.          C4a. hmmsearch Compares protein alignment/profile-HMM to a protein sequence database.          C4b. hmmscan- Compares a protein sequence to a profile-HMM database.          C4c. phmmer- Compares a protein sequence to a protein database.         C4d. jackhmmer- Compares a protein sequence to a protein database iteratively. 6. Mapping, Primer design and RNA Secondary Structure. Feb. 17 Read: Bioinformatics and Functional Genomics p. 433-459; A. Mapping Restriction enzyme selection and depiction, using Nebcutter2. B. Primer design: B1. Thermodynamics of DNA melting. B2. Primer design: Primer-blast. B3. Degenerate Primers: backtranseq.
  1. Vecscreen
  2. RNA secondary structure prediction – Mfold
7. Genomic Analysis. Feb. 24 Read: Bioinformatics and Functional Genomics 957-979. NCBI dbsnp:988-992;; 1. Filtering of repetitive sequences using Repeatmasker. 2. Exon and gene identification: Genscan.
  1. Promoter identification. Ppnn web-site.
  2. The Transfac databases.
  3. Identifying Transfac Profiles with Match.
  4. Probabilities of TFBSs with RSAT
  5. cDNA- Genomic DNA alignment.
  6. The Santa Cruz Human and Mouse Genome Map web-site.
  7. The NCBI Genomic web-sites.
March 3 No class- Spring break. 8. Protein structure prediction, Mar. 10 Read: Bioinformatics and Functional Genomics Chapter 13. A. Composition and digestion: compseq, pepstats, pepdigest (EMBOSS) B. Secondary structure and hydrophobicity. Classical methods. B1. Introduction to protein secondary structure and hydrophobicity. B2. The Chou-Fasman secondary structure prediction method. pepinfo EMBOSS). B3. Kyte-Doolittle hydrophobicity, pepinfo(EMBOSS).
  1. Neural network based methods. The Predict-Protein Web server.
C1. Secondary structure prediction of water-soluble proteins. C2. Secondary structure prediction of membrane proteins. C3. Surface accessibility.
  1. Signal Peptide identification- SignalP web server.
  2. Coiled-Coiled regions – pepcoil
  3. Subcellular location (the LocTarget (NLS, LocKey, LocHom, LocNet).
  4. Globularity analysis with segmasker.
  5. Threading: Phyre
9. Molecular Systematics Mar. 17 Read: Bioinformatics and Functional Genomics Chapter 7
  1. Molecular species trees: Rooted and Unrooted.
  2. Newick notation.
  3. Mutational basis of molecular systematics.
  4. Protein vs. nucleic acid methods.
  5. Systematic methods in BLAST.
  6. Distance Methods – Upgma and Neighbor Joining as implemented in Clustalx.
  7. The maximum likelihood method – PROTML.
  8. Statistical significance of systematics trees.
10. Functional Genomics I: Microarray Analysis Mar. 24 Read:; Bioinformatics and Functional Genomics P. 460-478, 504-511; the PowerPoint slides for this lesson available on the courseworks site (read notes as well as slides); About AffylmGUI :; Running the Estrogen Dataset
  1. Experimental Methods
  2. Glass-slide cDNA.
  3. Affymetrix oligonucleotide.
  4. Normalization
  5. Need for normalization.
  6. Example of normalization method: GCRMA.
  7. Statistical Analysis of differential expression.
  8. Statistical Theory
  9. The normal distribution.
  10. P-values.
  11. Small sample size: t-test.
  12. Multiple-tests: False Discovery Rate.
e.. Theory of LIMMA (LInear Models for MicroArrays)
  1. Using AffylmGUI.
11. Functional Genomics II: Functional Databases and Clustering, Mar. 31 Read: Bioinformatics and Functional Genomics. Chapter 14, 676-678, 682-685, 1036-1046. 511-516.
  1. Functional Genomic Databases
  2. NCBI Gene Database
  3. Online Mendelian Inheritance in Man.
  4. Gene Ontology Database.
  5. KEGG: Kyoto Encyclopedia of Genes and Genomes.
  6. Functions and pathways from differential expression.
  7. The chi square distribution and overrepresentation analysis.
  8. Webgestalt – Pathway database searching.
  9. Clustering (unsupervised learning)
  10. Theory of hierarchical clustering. Generation of heat maps and dendrograms.
  11. K-means clustering.
  12. Principal component analysis
  13. Use of Cluster 3.0 and Treeview to use the above algorithms.
12. Functional Genomics III: RNAseq and Quantitative Real-time PCR Apr. 7 Read: Bioinformatics and Functional Genomics. Chapter 9, 519-521
  1. RNASeq
  1. The Illumina RNASeq platform.
  2. RNASeq File formats: Fastq, SAM, BAM, GFF, GTF,
  3. RNASeq quality control FastQC.
  4. Burroughs Wheeler alignment to the Genome: Bowtie.
  5. Spliced Alignment of Reads to the Genome: Tophat2.
  6. Alignment by vote-and-count: Subread.
  7. Counting Gene Copies: HtSeq/FeatureCounts.
  8. Normalization of data: TMM.
  9. Theory of comparison of counts: The Poisson and negative binomial distributions.
  1. Differential expression of genes from RNASeq data: DeSeq, EdgeR, Limma- Voom.
  1. Some of the above methods will be implemented in a hands-on-exercise with OneChannelGUI.
  2. Real-time quantitative PCR
  1. The Real-time PCR experiment.
  2. Analytical pitfalls and their solutions:
  3. Non-normality: Use negative cycles.
  4. Pseudoreplication: Averaging or mixed effects models.
  1. Processing real QT-PCR data in Excel.
14. Lecture: Classification. Apr 14 Read: Design and analysis of microarray experiments by Richard Simon et al. Chapter 8. Available for free as a pdf at:; Wikipedia article: Sensitivity and Specificity:; Wikipedia article Receiver Operator Characteristic: A. Methods of binary classification.
  1. Compound Covariate.
  2. Discriminant analysis.
  3. Logistic regression
  4. Regularized logistic regression.
  5. Nearest neighbor classifiers.
B. Design and sample size.
  1. Training set and test set.
  2. Sample size.
  3. Cross validation.
  4. Sensitivity and Specificity.
  5. Receiver operator curves.
C. Implementation of above concepts in BRBarrayTools. 14. Final. Apr. 21 The final is required of students who take the course for a letter grade (BINF 4013) only. Students who take the course Pass/Fail (CMBS4020) do not have to take the final.