ECM3413 - Bioinformatics

Contents

General Information

Lecture Slides

Past Exam Paper

Continuous Assessments

Suggested Reading List

General Information

	This module runs in Semester 2.
	It is taught by Dr Ed Keedwell (Module Coordinator)
	Module Descriptor:  ECM3413
	Lecture Times: Tuesday 5pm,  171| Thursday, 171
	Workshop Times: Wednesday 11am Blue Room (Weeks 29,33 &40)
	Assessment: 2 CAs each worth 15% | 1 Examination worth 70%

Lecture Slides (if you have to print slides, to save your ink choose 'print in black and white' on the print menu)

	PPT|PDF| Lecture 1 - Introduction to Bioinformatics (& Biology)
	PPT|PDF| Lecture 2 - Genome Sequences: from fragments to sequences
	PPT|PDF| Lecture 3 - Sequence Alignment 1
	PPT|PDF| Lecture 4 - Global Pairwise Sequence Alignment
	PPT|PDF| Lecture 5 - Local Pairwise Sequence Alignment (Smith-Waterman & BLAST)
	DOC| Workshop 1 - Using BLAST and other Bioinformatics Databases
	PPT|PDF| Lecture 6 - Multiple Sequence Alignment
	PPT|PDF| Lecture 7 - BLAST (in more detail) & FASTA
	PPT|PDF| Lecture 8 - Sequence Alignment Conclusion & Other Sequence Analyses
	PPT|PDF| Lecture 9 - Markov Chains and Intro to Hidden Markov Models
	PPT|PDF| Lecture 10 - Hidden Markov Models
	PPT|PDF| Lecture 11 - Classification in Bioinformatics
	DOC|Workshop 2 - Using See5
	Workshop Data - Part 1 - adult.names | adult.data | adult.test, Part 3 - wdbc.names| wdbc.data
	PPT|PDF| Lecture 12 - Gene Expression Data
	PPT|PDF| Lecture 13 - Decision Trees and Gene Expression Classification
	PPT|PDF| Lecture 14 - Other Methods for Gene Expression Classification
	PPT|PDF| Lecture 15 - Gene Regulation
	PPT|PDF| Lecture 16 - Neural Networks in Gene Expression Analysis
	PPT|PDF| Lecture 17 - Genome Analysis
	PPT|PDF| Lecture 18 - Conclusion/Revision Lecture

For some reason best known to itself, my PDF creator doesn't like the slide with the substitution matrix on.  Therefore this has been removed from Lectures 3 and 7 for the PDF copy only - however, more information on these matrices can be found here.

Past Exam Paper

The paper from 2007/8 can be found here.

Continuous Assessments

	PDF|  CA1 - Manual Sequence Alignment
	PDF|Promoter.names|Promoter.data|ML.names|ML.data| CA2 - Data Mining in Bioinformatics

Suggested Reading List

General Bioinformatics

<="top">Xiong, J., (2006) Essential Bioinformatics, Cambridge University Press

	Lesk, A.M., (2002) Introduction to Bioinformatics, Oxford University Press
	Higgs, P.G., (2005) Bioinformatics and Molecular Evolution,  Blackwell Publishing

Machine Learning in Bioinformatics

	Baldi, P., Brunak, S., (2001) Bioinformatics: The Machine Learning Approach, MIT Press
	Keedwell, E., Narayanan, A., (2005) Intelligent Bioinformatics: The Application of Artificial Intelligence Techniques to Bioinformatics Problems, Wiley

Link @ http://bioinf.boku.ac.at/

Professor/Senior Lecturer of Comparative Genomics
Vacancy Ref: 153610
Salary: Professor, Grade 10 will be within the Professorial range and
subject to negotiation
Senior Lecturer, Grade 9, 57,696 - 64,914 per annum

The School of Biodiversity, One Health and Veterinary Medicine has an
exciting opportunity to appoint a Professor/Senior Lecturer in Comparative
Genomics. You will make a substantial and positive contribution to the
strategic direction of the School/College through leading and contributing
to research of international standard, high quality teaching at both
undergraduate and postgraduate level, securing research funding, and
providing academic leadership and management within the School/College.

Applications are invited from candidates of international standing with
an appropriate record of academic achievement in comparative genomics
and associated omics technologies. We are looking for a candidate who
will complement our existing strengths in clinical veterinary medicine,
evolutionary biology, and animal physiology, with a demonstrable interest
in using domestic mammals among their study systems. We are particularly
interested in applications from candidates with a track record of
studying health related traits and their underlying genomic basis in
companion animals. Traits of specific interest include those related
to metabolism, ageing, and disease (e.g. cancer, autoimmune diseases,
neuromuscular disorders).

The School of Biodiversity, One Health and Veterinary Medicine is home to
researchers studying organismal biology and animal health across a diverse
range of systems, approaches and disciplines with existing strengths
in infectious disease, physiology, ageing, veterinary epidemiology, and
evolution among others. You will be based on the University of Glasgow's
Garscube campus, where the majority of veterinary teaching and research
infrastructure is located. This includes the Small Animal Hospital (a
recent 15M investment) and our Veterinary Diagnostic Services, offering
excellent opportunities for collaborative research at the clinical and
translational interface, especially with respect to companion animals.

We welcome applications from candidates with a Scottish Credit and
Qualification Framework level 12 (PhD) in animal biology, genomics and
health or related discipline with an extensive and established reputation
in research and significant teaching experience within the subject area.

This post is full time and open ended.

Visit our website for further information on The University of
Glasgow's, School of Biodiversity, One Health & Veterinary Medicine,
https://www.gla.ac.uk/schools/bohvm/

Informal Enquiries should be directed to Professor Roman Biek,
Roman.Biek@glasgow.ac.uk

Apply online at:
https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=153610

for applicants interested in performing high-quality research on the connection between software engineering, database systems, and theoretical computer science as well as their applications in bioinformatics and business informatics. The research programme will start on October 1, 2013 until 30.09.2016. The period of employment is governed by the Fixed Term Research Contracts Act (Wissenschaftszeitvertragsgesetz – WissZeitVG).

This research programme is a joint activity of Professors Lehner, Assmann, Baader, Baier, Schill, Schlegel, Schroeder, and Strahringer at TU Dresden. Alongside their research, an individual mentoring and qualification approach are arranged with specialized courses that prepare them optimally for their research, a research seminar where they can meet internationally renowned researchers in the field, and soft skills and language courses.

Requirements: Applicants should have an excellent academic record, and hold a MSc (or an equivalent university degree) in computer science or related disciplines (such as mathematics, bioinformatics or business informatics). Fluency in spoken and written English is required. Applicants with a good knowledge of software engineering or one of the application areas mentioned above are preferred. TU Dresden is committed to increase the proportion of women in research.

Applications from women are particularly welcome. The same applies to disabled people.

Please send enquiries to: wolfgang.lehner@tu-dresden.de

Applications consist of a CV, the names of two referees, transcipts of documents summarizing their academic performance, and a statement of interest. Application by email in pdf format is preferred, and should be submitted to wolfgang.lehner@tu-dresden.de in an electronically signed and encrypted form by July 30, 2013 (stamped arrival date of the university central mail service applies). Alternatively, applications can be sent to: TU Dresden, Fakultät Informatik, Institut für Systemarchitektur, Prof.  Dr.-Ing.  Wolfgang Lehner, 01062 Dresden, Germany.

Shortlisted candidates will be invited to Dresden in the middle of August to give a presentation on their Master’s thesis and discuss their research interest with the participating professors. Candidates that have not yet finished their degree when they send in their application should send preliminary transcripts of their academic records as well as a letter by the thesis adviser that comments on their progress so far and on the expected date of completion of their MSc or equivalent degree.

1. RNA-Seq Analysis Pipelines

RNA-seq is one of the most popular techniques for studying RNA. These tools streamline processing raw sequence data:

• FASTQC: For quality control of raw RNA-seq reads.
• Trimmomatic: For trimming and filtering RNA-seq reads.
• HISAT2/STAR: High-performance aligners for RNA-seq reads.
• FeatureCounts: For quantifying gene expression.
• DESeq2/EdgeR: For differential expression analysis.

2. Transcriptome Assembly and Annotation

For analyzing transcriptomes from non-model organisms or assembling novel transcripts:

• Trinity: For de novo transcriptome assembly.
• StringTie: For transcript assembly and quantification from RNA-seq alignments.
• TransDecoder: To predict coding regions within assembled transcripts.
• TAU: Tools for annotating non-coding and coding RNAs.

3. Exploring Non-Coding RNA (ncRNA)

Non-coding RNAs play critical regulatory roles. Dedicated tools for studying them include:

• Infernal: For identifying ncRNA sequences based on covariance models.
• Rfam: Database and tools for ncRNA families.
• miRDeep: For identifying microRNAs in RNA-seq datasets.

4. RNA Structure and Motif Analysis

Structural biology of RNA helps in understanding its function:

• RNAfold (ViennaRNA): Predicts secondary structures from RNA sequences.
• RNAstructure: Tools for RNA secondary structure prediction and analysis.
• MEME Suite: For identifying motifs in RNA sequences.
• IntaRNA: For RNA-RNA interaction prediction.

5. RNA Editing and Modifications

Epitranscriptomics is a growing field focusing on RNA modifications:

• REDItools: For RNA editing analysis.
• m6Aboost: For identifying m6A modifications in RNA.

6. Long-Read RNA Sequencing Analysis

Long-read technologies like Nanopore and PacBio are transforming RNA research:

• FLAIR: For isoform-level analysis of long-read RNA-seq data.
• NanoMod: For detecting modifications in RNA from Nanopore sequencing.

7. RNA-Protein Interactions

To study RNA-protein interactions and complexes:

• RBPmap: For identifying RNA-binding protein motifs.
• PARalyzer: For analyzing PAR-CLIP data.

8. Functional Enrichment Analysis

Understanding biological functions and pathways from RNA-seq data:

• getENRICH: A tool designed for pathway enrichment analysis of non-model organisms (hypergeometric P-value calculation with FDR correction).
• ClusterProfiler: For GO and KEGG pathway enrichment analysis.

9. Visualization and Data Sharing

Presenting and sharing RNA sequence analysis results effectively:

• IGV: Genome browser for visualizing RNA-seq alignments.
• Circos: Circular visualization of RNA-seq data.
• DashBio: A Python library for creating bioinformatics visualizations.

Conclusion

The bioinformatics landscape for RNA sequence analysis is vast, with tools catering to specific needs. Whether you’re studying coding RNAs, non-coding RNAs, or exploring RNA-protein interactions, the right tools can transform your data into biological insights.

Link @ http://lgfus.ca/public/

While the expectations are not entirely off base, the reality of life as a bioinformatician is a mix of exciting discoveries, troubleshooting, and, let’s admit it, a fair amount of frustration. Here’s what it’s really like:

1. Expectation: Seamlessly Working with Perfect Datasets

Reality: You often receive messy, incomplete, or poorly annotated datasets. Hours are spent cleaning, normalizing, and validating data before you even begin your analysis. "Garbage in, garbage out" is a constant reminder in your workflow. Tools designed to handle these problems exist, but they require significant customization, which adds another layer of complexity.

2. Expectation: Effortless Multidisciplinary Integration

Reality: Bridging biology and computational science is far from straightforward. You need to be proficient in both domains while keeping up with advancements in genomics, machine learning, and statistics. Additionally, collaborating with biologists who might not be fluent in computational jargon requires patience and effective communication skills.

3. Expectation: Rapid, Groundbreaking Results

Reality: Analysis often involves waiting—waiting for scripts to run, pipelines to complete, or software to install. Bioinformatics projects are iterative; you analyze, debug, and refine repeatedly. A single project might take months to complete due to unforeseen challenges, like computational bottlenecks or the need for additional experiments.

4. Expectation: Beautiful Visualizations with a Click

Reality: While tools like R, Python, and specialized software can create stunning plots, generating a publication-ready visualization requires significant effort. You’ll spend hours tweaking axes, labels, and color palettes, ensuring clarity and accuracy.

5. Expectation: All Work, No Bugs

Reality: Debugging is an integral part of the job. Whether it’s a misconfigured server, a script throwing unexpected errors, or a pipeline breaking due to an update, you’ll develop a knack for problem-solving under pressure.

6. Expectation: Ample Time for Skill Development

Reality: Bioinformatics moves fast. Juggling ongoing projects, tight deadlines, and the constant stream of new tools and algorithms leaves little time for leisurely learning. Staying updated requires proactive effort—evenings, weekends, or dedicated study breaks.

7. Expectation: Publishing Papers Regularly

Reality: Publishing in bioinformatics is a marathon, not a sprint. Your analysis needs to be thorough, reproducible, and supported by strong biological insights. Reviewers often demand additional experiments or clarifications, stretching the timeline even further.

8. Expectation: A Clear Career Path

Reality: Bioinformatics offers diverse career paths, from academia and industry to healthcare and government. However, the choice can be daunting, with each path requiring unique skill sets and presenting different challenges. Navigating these options takes time, research, and sometimes trial and error.

Finding Joy in the Chaos

Despite these challenges, being a bioinformatician is immensely rewarding. You are at the forefront of science, enabling discoveries that impact medicine, agriculture, and the environment. The thrill of uncovering insights hidden in complex datasets and the satisfaction of solving biological puzzles make the hard work worthwhile.

Advice for Aspiring Bioinformaticians

• Embrace Learning: The field is ever-evolving. Stay curious and adaptable.
• Develop Communication Skills: Bridging the gap between biology and computation is as much about explaining your methods as it is about applying them.
• Find a Community: Collaborate with peers, join forums, and attend conferences to stay inspired and updated.
• Celebrate Small Wins: Every cleaned dataset, successful script, or informative plot is a step forward.

Bioinformatics is a blend of science, technology, and artistry. While the reality might not match the polished expectations, the journey is nothing short of exhilarating. If you’re ready to embrace the chaos and keep learning, the field of bioinformatics will never cease to amaze you.

Faculty facilitator/Founder Director for two start-up companies (Leadinvent incubated at IIT, Delhi from 2006-2009 & Novoinformatics, under incubation at IIT Delhi since 2011).

Research Interest
Genome Analysis, Protein Structure Prediction and Drug Design.

Link @ http://www.scfbio-iitd.res.in/

We use algorithms every day. For example, a recipe for baking a cake is an algorithm. Most programs, with the exception of some artificial intelligence applications, consist of algorithms. Inventing elegant algorithms -- algorithms that are simple and require the fewest steps possible -- is one of the principal challenges in programming. An algorithm is a description of a procedure which terminates with a result. In other words an algorithm is a set of instructions, sometimes called a procedure or a function, that is used to perform a certain task. This can be a simple process, such as adding two numbers together, or a complex function, such as adding effects to an image. For example, in order to sharpen a digital photo, the algorithm would need to process each pixel in the image and determine which ones to change and how much to change them in order to make the image look sharper.

In mathematics, computer science, and related subjects, an algorithm is an effective method for solving a problem using a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields.
Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness.

History

The origin of the term comes from the ancients. The concept becomes more precise with the use of variables in mathematics. Algorithm in the sense of what is now used by computers appeared as soon as first mechanical engines were invented.
The word algorithm comes from the name of the 9th century Persian Muslim mathematician Abu Abdullah Muhammad ibn Musa Al-Khwarizmi. The word algorism originally referred only to the rules of performing arithmetic using Hindu-Arabic numerals but evolved via European Latin translation of Al-Khwarizmi's name into algorithm by the 18th century. The use of the word evolved to include all definite procedures for solving problems or performing tasks.
The algorithm of Archimedes gives an approximation of the Pi number.
Eratosthenes has defined an algorithim for retrieving prime numbers.
Averroès (1126-1198) was using algorithmic methods for calculations.
Adelard de Bath (12 th) introduces the algorismus term, from Al-Khwarizmi.
During the 1800's up to the mid-1900's:

- George Boole (1847) has invented the binary algebra, the basis of computers. Actually he has unified logic and calculation in a common symbolism.

- Gottlob Frege (1879) formula language's, that is a lingua characterica, a language written with special symbols, "for pure thought", that is free from rhetorical embellishments... constructed from specific symbols that are manipulated according to definite rules.

- Giuseppe Peano (1888) It's The principles of arithmetic, presented by a new method was the first attempt at an axiomatization of mathematics in a symbolic language.

- Alfred North Whitehead and Bertrand Russell in their Principia Mathematica (1910-1913) has further simplified and amplified the work of Frege.

- Kurt Goëdel (1931) cites the paradox of the liar that completely reduces rules of recursion to numbers.

The concept of algorithm was formalized in 1936 through Alan Turing's Turing machines and Alonzo Church's lambda calculus, which in turn formed the foundation of computer science.
Stephen C. Kleene (1943) defined his now-famous thesis known as the "Church-Turing Thesis". In this context:

" Algorithmic theories... In setting up a complete algorithmic theory, what we do is to describe a procedure, performable for each set of values of the independent variables, which procedure necessarily terminates and in such manner that from the outcome we can read a definite answer, "yes" or "no," to the question, "is the predicate value true?"

Classification

Classification by purpose

Each algorithm has a goal, for example, the purpose of the Quick Sort algorithm is to sort data in ascending or descending order. But the number of goals is infinite, and we have to group them by kind of purposes:

Classification by implementation

An algorithm may be implemeted according to different basical principles.

• Recursive or iterative

A recursive algorithm is one that calls itself repeatedly until a certain condition matches. It is a method common to functional programming. 
Iterative algorithms use repetitive constructs like loops.
Some problems are better suited for one implementation or the other. For example, the towers of hanoi problem is well understood in recursive implementation. Every recursive version has an iterative equivalent iterative, and vice versa.

• Logical or procedural

An algorithm may be viewed as controlled logical deduction. 
A logic component expresses the axioms which may be used in the computation and a control component determines the way in which deduction is applied to the axioms. 
This is the basis of the logic programming. In pure logic programming languages the control component is fixed and algorithms are specified by supplying only the logic component.

• Serial or parallel

Algorithms are usually discussed with the assumption that computers execute one instruction of an algorithm at a time. This is a serial algorithm, as opposed to parallel algorithms, which take advantage of computer architectures to process several instructions at once. They divide the problem into sub-problems and pass them to several processors. Iterative algorithms are generally parallelizable. Sorting algorithms can be parallelized efficiently.

• Deterministic or non-deterministic

Deterministic algorithms solve the problem with a predefined process whereas non-deterministic algorithm must perform guesses of best solution at each step through the use of heuristics.

Classification by design paradigm

A design paradigm is a domain in research or class of problems that requires a dedicated kind of algorithm:

• Divide and conquer

A divide and conquer algorithm repeatedly reduces an instance of a problem to one or more smaller instances of the same problem (usually recursively), until the instances are small enough to solve easily. One such example of divide and conquer is merge sorting. Sorting can be done on each segment of data after dividing data into segments and sorting of entire data can be obtained in conquer phase by merging them.
The binary search algorithm is an example of a variant of divide and conquer called decrease and conquer algorithm, that solves an identical subproblem and uses the solution of this subproblem to solve the bigger problem.

• Dynamic programming

The shortest path in a weighted graph can be found by using the shortest path to the goal from all adjacent vertices. 
When the optimal solution to a problem can be constructed from optimal solutions to subproblems, using dynamic programming avoids recomputing solutions that have already been computed. 
- The main difference with the "divide and conquer" approach is, subproblems are independent in divide and conquer, where as the overlap of subproblems occur in dynamic programming. 
- Dynamic programming and memoization go together. The difference with straightforward recursion is in caching or memoization of recursive calls. Where subproblems are independent, this is useless. By using memoization or maintaining a table of subproblems already solved, dynamic programming reduces the exponential nature of many problems to polynomial complexity.

• The greedy method

A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage. Instead a "greedy" choice can be made of what looks the best solution for the moment. 
The most popular greedy algorithm is finding the minimal spanning tree as given by Kruskal.

• Linear programming

The problem is expressed as a set of linear inequalities and then an attempt is made to maximize or minimize the inputs. This can solve many problems such as the maximum flow for directed graphs, notably by using the simplex algorithm. 
A complex variant of linear programming is called integer programming, where the solution space is restricted to all integers.

• Reduction also called transform and conquer

Solve a problem by transforming it into another problem. A simple example: finding the median in an unsorted list is first translating this problem into sorting problem and finding the middle element in sorted list. The main goal of reduction is finding the simplest transformation possible.

• Using graphs

Many problems, such as playing chess, can be modeled as problems on graphs. A graph exploration algorithms are used. 
This category also includes the search algorithms and backtracking.

The probabilistic and heuristic paradigm

• Probabilistic

Those that make some choices randomly.

• Genetic

Attempt to find solutions to problems by mimicking biological evolutionary processes, with a cycle of random mutations yielding successive generations of "solutions". Thus, they emulate reproduction and "survival of the fittest".

• Heuristic

Whose general purpose is not to find an optimal solution, but an approximate solution where the time or resources to find a perfect solution are not practical.

Classification by complexity

Some algorithms complete in linear time, and some complete in exponential amount of time, and some never complete.

Algorithms resources on net.

Graph Algorithms in Bioinformatics

Bioinformatics Algorithms Description

Bioinformatics Algorithms Course Page

Bioinformatics Algorithm Demonstrations

Introduction to Bioinformatics Algorithms Lectures 1-2 by Dr. Max Alekseyev USC, 2009

Online Lectures on Bioinformatics

Sequence Alignment Algorithms

Algorithm for sequence alignment: dynamic programming

Network Protocol Analysis using Bioinformatics Algorithms

Bioinformatics Algorithms Links

Dynamic Programming

Particularly good sites...

•http://www.cis.upenn.edu/~sahuguet/MSA/
•http://www.blc.arizona.edu/courses/bioinformatics/align.html
•http://www.cs.monash.edu.au/~lloyd/tildeStrings/Notes/DPA.html
•http://www.cs.orst.edu/~schut/cs325/dynamic.htm
•http://www.catalase.com/dprog.htm
•http://bioweb.ncsa.uiuc.edu/~bioph490/BIOPH2.html#SEQUENCE_COMP
•http://www.qucis.queensu.ca/home/cisc365/javascript/dp1/index.html
Other sites...
•http://bioweb.ncsa.uiuc.edu/~bioph490/dynamic_programming_demo.html
•http://www.qucis.queensu.ca/home/cisc365/365overheads.html
•http://www.qucis.queensu.ca/home/cisc365/dp/dp.p01.html
•http://www.dgp.toronto.edu/csc270/tut_dp.html
•http://queue.ieor.berkeley.edu/~jshu/knapsack/DP/dp.html
•http://mat.gsia.cmu.edu/classes/dynamic/dynamic.html
•http://www.cs.sandia.gov/~scistra/class_3
•http://levine.sscnet.ucla.edu/Econ101/dynamic.htm
•http://mat.gsia.cmu.edu/classes/stoch_dynamic/stoch_dynamic.html
•http://mat.gsia.cmu.edu/classes/dynamic/node8.html
•http://www.maths.mu.oz.au/~moshe/dp/bibl/bibliography.html
•http://cartan.gmd.de/PAPER/ismb95/ismb_html.html
•http://screwdriver.bu.edu/bibliography/dynamic_programming.htm
•http://www.norvig.com/design-patterns/
•http://tome.cbs.univ-montp1.fr/htmltxt/Doc/manual/node137.html
•http://poem.princeton.edu/~verdu/dynamic.html
•http://www.orca1.com/opushelpweb/opusDynamic_Programming.html
•http://screwdriver.bu.edu/cn760-lectures/l7/index.htm
•http://www.ms.unimelb.edu.au/~moshe/dp/dp.html
•http://mat.gsia.cmu.edu/ORCS/0255.html
•http://aae.wisc.edu/e703/notes/a13dynpr.htm
•http://bioweb.pasteur.fr/docs/modeller/node137.html
•http://www2.uwindsor.ca/~lama/my470/ddynamic.htm
•http://students.ceid.upatras.gr/~papagel/project/ex5_6_1.htm
•http://www.cs.sunysb.edu/~algorith/lectures-good/node12.html
•http://www.cs.sunysb.edu/~algorith/lectures-good/node12.html
•http://www.utdallas.edu/~scniu/documents/7315.htm
•http://www.ii.uib.no/~pinar/seminar/larry.html
•http://www.deakin.edu.au/~gecole/books.html
•http://www.cseg.engr.uark.edu/~wessels/algs/notes/dynamic.html
•http://www.csc.liv.ac.uk/~ped/teachadmin/algor/dyprog.html
•http://www.eli.sdsu.edu/courses/fall96/cs660/notes/dynamicProg/dynamicProg.html
•http://www.cs.indiana.edu/l/www/ftp/techreports/TR514.html
•http://www.cs.brandeis.edu/~mairson/poems/node3.html
•http://www.cis.tu-graz.ac.at/igi/oaich/animations/Dynamic2.html
•http://bioweb.ncsa.uiuc.edu/~workshop/

Smith Waterman
•http://genome-www.stanford.edu/Saccharomyces/help/sw_alignment.html
•http://genome-www.stanford.edu/Saccharomyces/help/sw_details.html
•http://www.stanford.edu/~sntaylor/bioc218/final.htm
•http://www.maths.tcd.ie/~lily/pres2/sld009.htm
•http://bioweb.ncsa.uiuc.edu/~workshop/Lab_3/Smith-Waterman.htm
•http://www.tigem.it/LOCAL/SW/threshold.html
•http://sgbcd.weizmann.ac.il/genweb/help/smith-waterman.html
•http://cbrg.ethz.ch/ServerBooklet/section2_3_5.html
Needleman & Wunsch
•http://www.maths.tcd.ie/~lily/pres2/sld003.htm
•http://acer.gen.tcd.ie/~amclysag/nwswat.html
•http://www.nada.kth.se/~erikw/thesis/chapter2_3.html
•http://www.irbm.it/irbm-course95/gb/docs/amps/subsection3_6_1.html
•http://www.ibc.wustl.edu/~zuker/Bio-5495/align-html/node3.html

General (NW vs. SW vs. HMM, etc.)

•http://www.maths.tcd.ie/~lily/pres2/
•http://acer.gen.tcd.ie/~amclysag/nwswat.html
•http://laguerre.psc.edu/biomed/TUTORIALS/SEQUENCE/MULTIPLE/tutorial.html
•http://www.cse.ucsc.edu/research/compbio/

Hmms

•http://www.medmicro.mds.qmw.ac.uk/HMMER/main.html
•http://alfredo.wustl.edu/ismb96/abs/p02.html
•http://www.cse.ucsc.edu/research/compbio/html_format_papers/hughkrogh96/cabios.html
•http://wwwsyseng.anu.edu.au/~jason/hmmlinks.html
•http://www.breadfan.com/markov.html
•http://cslu.cse.ogi.edu/HLTsurvey/ch1node34.html
•http://www.ibc.wustl.edu/service/hmmalign/glocal.html
•http://www.cse.ucsc.edu/research/compbio/html_format_papers/ismb94/node5.html
•http://www.iscs.nus.edu.sg/~luakt/ic3222/lecture/nlp18new/index.htm
•http://www.cse.ucsc.edu/research/compbio/sam.html SAM Software for HMMs

Genetic Algorithms

•http://www.staff.uiuc.edu/~carroll/ga.html
•http://kal-el.ugr.es/gags.html
•http://kal-el.ugr.es/~jmerelo/GAJS.html
•http://www.genetic-programming.org/
•http://www.iitk.ac.in/kangal/deb_tut.shtml