The job description: "This research position focuses on the science
of bacterial evolution. It will consist of researching theoretical
principles, but could include translational applications. Phylogenomic
and bioinformatic analysis of bacterial populations in nature or
in laboratory experiments will be a key component of the work. Prior
experience is an asset though training will be possible at PMI.
Likewise, laboratory microbiological, molecular, and biochemical
skills are an asset though not essential. Communication and critical
thinking skills are essential for performing the work and for
communicating to the local and international scientific communities.
Participating in team or independent grant writing to obtain research
funding will be required. Student mentoring is a part of the NAU
mission and is a partial expectation."

https://hr.peoplesoft.nau.edu/psp/ph92prta/EMPLOYEE/HRMS/c/HRS_HRAM.HRS_APP_SCHJOB.GBL?Page=HRS_APP_JBPST&Action=U&FOCUS=Applicant&SiteId=1&JobOpeningId=608024&PostingSeq=1

Northern Arizona University is located in Flagstaff, Arizona, a
beautiful mountain town with a surprisingly vibrant restaurant
scene. Located a little over an hour from the Grand Canyon and ~45
min from Sedona, Flagstaff is a hiker's paradise. In fact, the city
of Flagstaff operates more than 50 miles of unpaved trails and there
are, on average, 266 sunny days per year with which to enjoy them.
At 7000 ft in elevation, Flagstaff experiences all four seasons,
but thesummers are mild and, in the winter, you can be on the ski
slopes within 30 min! https://www.flagstaffarizona.org/

As mentioned, joint projects with Professor Sheppard at Oxford
University are possible, including travel to his laboratory in the
United Kingdom. https://www.biology.ox.ac.uk/people/samuel-sheppard

Contact Information:
Paul.Keim@nau.edu

Paul S. Keim, Ph.D.
Regents Professor, &
Cowden Endowed Chair of Microbiology
Northern Arizona University
Flagstaff, AZ 86011-4073

Paul S Keim

Our long-term research objective is to understand microtubule organization in living cells, with an emphasis on mitosis. We develop in-vitro assays, quantitative image analysis and cytosim, a computer simulation to study cellular architecture from a mechanistic angle, modeling the interactions of microtubules and related proteins such as molecular motors. In the past, we combined simulations and experiments to study microtubule self-organization, and the mechanical stability of two interacting asters. More recently, we looked at the focusing of mitotic fibers, the formation of antiparallel arrays of microtubules in fission yeast and the spindle positionning in C. elegans.
We are supported by BioMS, an initiative in Systems Biology, and involved in Cell networks.

Link: http://www.cytosim.org

What is Bacterial Comparative Genomics?

Comparative genomics involves the systematic comparison of genomes across different bacterial species or strains. This approach allows scientists to:

• Identify conserved and unique genes.

• Explore genetic determinants of pathogenicity.

• Understand bacterial evolution and phylogenetics.

• Investigate horizontal gene transfer and its role in antibiotic resistance.

Bioinformatics is central to these analyses, enabling the processing and interpretation of large-scale genomic data.

Key Steps in Bacterial Comparative Genomics

1. Genome Sequencing and Assembly: The process begins with obtaining high-quality bacterial genome sequences. Advances in next-generation sequencing (NGS) technologies have made it faster and more affordable to sequence bacterial genomes. Tools such as SPAdes and Velvet are commonly used for genome assembly.

2. Genome Annotation: Annotating a genome involves identifying genes, regulatory elements, and other genomic features. Automated tools like Prokka and RAST provide functional annotations, allowing researchers to predict the roles of genes and proteins.

3. Genome Alignment: Aligning genomes is crucial for identifying conserved regions, single-nucleotide polymorphisms (SNPs), and structural variations. Tools like Mauve and progressiveMauve are commonly employed for whole-genome alignments.

4. Comparative Analyses:

   • Core and Pan-genome Analysis: The core genome consists of genes shared across all strains of a species, while the pan-genome includes all genes found in any strain. Software like Roary and BPGA can perform core and pan-genome analyses.

   • Phylogenetic Analysis: Comparative genomics often involves reconstructing evolutionary relationships. Tools such as MEGA and IQ-TREE facilitate phylogenetic tree construction based on genomic data.

   • Functional Enrichment Analysis: To understand the biological significance of unique or shared genes, functional enrichment analysis using databases like GO (Gene Ontology) and KEGG is essential.

Here are some additional bioinformatics tools that can aid bacterial comparative genomics:

• OrthoFinder: For accurate ortholog identification across multiple genomes.

• PanOCT: Specifically designed for pan-genome clustering and annotation.

• FASTANI: A tool for calculating Average Nucleotide Identity (ANI) for microbial genome comparisons.

• CIRCOS: For visually comparing genomic data through circular genome plots.

• Galaxy Platform: A user-friendly web-based platform offering numerous genomic analysis tools.

• BLAST: Essential for sequence alignment and similarity searches.

• PhyloSift: Focused on phylogenetic analysis of microbial genomes using marker genes.

These tools, in combination with the methods discussed, provide a robust framework for conducting comprehensive comparative genomic studies.

Applications of Bacterial Comparative Genomics

1. Understanding Pathogenicity: Comparative genomics helps identify virulence factors that distinguish pathogenic strains from non-pathogenic relatives. For instance, comparing genomes of Escherichia coli strains has revealed key genetic determinants of pathogenicity in enterohemorrhagic strains.

2. Antibiotic Resistance Research: The spread of antibiotic resistance genes through horizontal gene transfer is a major global concern. Comparative analyses can trace the origins and dissemination of resistance genes, aiding in the development of countermeasures.

3. Microbial Ecology and Evolution: By studying genomic variations, researchers can understand how bacteria adapt to different environments. This is particularly relevant for extremophiles and symbiotic bacteria.

4. Vaccine Development: Identifying conserved antigens across pathogenic strains is critical for vaccine design. Comparative genomics has been instrumental in developing vaccines against pathogens like Neisseria meningitidis.

5. Biotechnology Applications: Comparative studies can uncover unique metabolic pathways in bacteria, paving the way for applications in bioremediation, synthetic biology, and industrial microbiology.

Challenges in Bacterial Comparative Genomics

While the field has made significant strides, several challenges remain:

• Data Overload: The rapid growth of sequencing data requires robust computational infrastructure and efficient algorithms.

• Genome Plasticity: High rates of horizontal gene transfer and genome rearrangements in bacteria complicate comparative analyses.

• Annotation Accuracy: Automated annotation tools are not infallible, and manual curation is often needed for high-confidence results.

• Interpreting Non-Coding Regions: Understanding the functional significance of non-coding genomic regions remains a challenge.

Future Directions

The integration of bacterial comparative genomics with other ‘omics’ approaches—such as transcriptomics, proteomics, and metabolomics—promises a more comprehensive understanding of bacterial biology. Additionally, advancements in machine learning and artificial intelligence are likely to further enhance bioinformatics analyses, enabling the prediction of complex phenotypes from genomic data.

Conclusion

Bacterial comparative genomics, driven by bioinformatics, continues to unravel the complexities of bacterial life. From combating antibiotic resistance to uncovering the secrets of microbial evolution, this interdisciplinary field holds immense potential for addressing pressing challenges in microbiology and beyond. As technology advances, so too will our ability to harness the power of comparative genomics for scientific and societal benefit.

Research Area:
Mapping loci in ENU mutants in mice in complex pedigrees
Investigation of DNA sharing in distantly related individuals
CNV analysis in pedigrees and connections to linkage studies
Statistical Genetics

Link @ http://www.wehi.edu.au/faculty_members/dr_melanie_bahlo

What Are piRNAs?

piRNAs are the largest class of small non-coding RNAs, typically 24–32 nucleotides in length. Unlike microRNAs (miRNAs) and small interfering RNAs (siRNAs), piRNAs do not rely on Dicer enzymes for maturation. Instead, they are processed from long single-stranded precursors and associate with PIWI proteins, a subclass of the Argonaute protein family.

The primary functions of piRNAs include:

1. Silencing Transposable Elements: By targeting transposons, piRNAs prevent genomic instability, particularly in germline cells.
2. Regulating Gene Expression: piRNAs modulate gene expression at transcriptional and post-transcriptional levels.
3. Epigenetic Modulation: They guide epigenetic modifications, such as DNA methylation, to specific genomic loci.

Challenges in piRNA Research

Studying piRNAs is fraught with challenges, including:

• Short Length: Their small size complicates sequencing and alignment.
• Lack of Sequence Conservation: Unlike miRNAs, piRNAs exhibit limited sequence conservation across species.
• Complex Biogenesis: The intricate pathways of piRNA generation require sophisticated computational tools to unravel.

Bioinformatics: Illuminating the World of piRNAs

Bioinformatics has emerged as an indispensable tool for studying piRNAs, facilitating their discovery, annotation, and functional analysis. Here's how bioinformatics is transforming piRNA research:

1. Identification and Annotation

The discovery of piRNAs relies on next-generation sequencing (NGS) data. Bioinformatics tools such as piRNApredictor and Piano identify piRNA clusters and predict potential targets. Databases like piRBase and piRNAdb curate information about known piRNAs, their sequences, and associated proteins.

2. Mapping and Alignment

piRNAs often originate from repetitive regions, making their alignment challenging. Tools like Bowtie and STAR handle the unique mapping requirements of piRNAs, enabling accurate identification of piRNA clusters in genomes.

3. Functional Analysis

Bioinformatics approaches predict piRNA functions by analyzing their interactions with transposons, genes, and epigenetic marks. Algorithms such as TargetFinder and RIblast explore piRNA-mRNA interactions, shedding light on regulatory networks.

4. Evolutionary Studies

piRNAs are evolutionarily diverse, reflecting their roles in species-specific genomic defense. Comparative genomics tools help trace the evolution of piRNA clusters and their associated PIWI proteins across species.

5. Epigenomic Insights

piRNAs are key players in epigenetic regulation. Bioinformatics pipelines integrate piRNA data with chromatin immunoprecipitation sequencing (ChIP-seq) and DNA methylation data to uncover their role in shaping the epigenome.

Case Study: piRNAs in Germline Integrity

One of the hallmark functions of piRNAs is the suppression of transposable elements in the germline. For example, in Drosophila melanogaster, piRNAs target retrotransposons like gypsy and copia. Bioinformatics analyses revealed that these piRNAs guide PIWI proteins to transposon-derived RNA, ensuring genome stability during gametogenesis.

Clinical Relevance of piRNAs

Recent studies suggest that piRNAs may serve as biomarkers for diseases such as cancer, infertility, and neurodegenerative disorders. For instance:

• Cancer: Dysregulated piRNA expression has been linked to tumorigenesis, making them potential targets for cancer therapies.
• Infertility: Aberrant piRNA pathways are implicated in male infertility due to their role in spermatogenesis.
• Neurodegeneration: piRNAs may regulate neuronal gene expression, highlighting their potential in neurological research.

Future Directions

The integration of bioinformatics with emerging technologies offers exciting opportunities for piRNA research:

• Single-Cell Sequencing: Unveiling cell-specific piRNA expression and function.
• Machine Learning: Predicting piRNA functions and targets with greater accuracy.
• CRISPR-Based Tools: Editing piRNA clusters to explore their roles in vivo.

Conclusion

piRNAs are the unsung guardians of the genome, safeguarding genetic material from transposable elements and contributing to gene regulation and epigenetic programming. Bioinformatics has opened the floodgates of discovery, unraveling the complexities of piRNAs and their myriad roles in biology and disease.

As we continue to decode the piRNA landscape, these small RNAs promise to unveil big secrets about genome stability, evolution, and human health, cementing their place as a fascinating frontier in molecular biology.

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