Genome Annotation and Functional Genomics

Bergman Lab is actively engaged in the development and application of computational methods to improve the annotation of functional biological features in genome sequences. Bergman Lab work focuses on improving annotation of non-protein-coding regions of the genome including conserved noncoding sequences (CNSs), cis-regulatory modules (CRMs), transcription factor binding sites (TFBSs), transposable elements (TEs) and noncoding RNA (ncRNA) genes. Current projects include improving the (i) annotation of TEs in the fly and yeast genomes, (ii) annotation of CRMs and TFBSs in the fly genome, and (iii) analysis of transposon knockout collections in flies. Research in this area is supported by the EC FP7 programme.

Genome and Molecular Evolution
Text and Data Mining

More @ http://bergmanlab.smith.man.ac.uk/

Sequence Analysis and General Bioinformatics

• BLAST, Ian Korf, Mark Yandell, Joseph Bedell, 2003, O'Reilly
• Sequence Analysis in a Nutshell: A Guide to Common Tools and Databases, Scott Markel, Darryl Leon, 2003, O'Reilly
• Bioinformatics for Geneticists, Michael Barnes, Ian C Gray (Editors), 2003, John Wiley & Sons
• Bioinformatics for Dummies, Jean-Michel Claverie, Cedric Notredame, 2003, John Wiley & Sons
• Mathematics of Genome Analysis, Jerome K. Percus, 2002, Cambridge Univ Press
• Bioinformatics Computing, Bryan P. Bergeron, 2002, Prentice Hall
• Evolutionary Computation in Bioinformatics, Gary B. Fogel, David W. Corne (Editors), 2002, Morgan Kaufmann
• Introduction to Bioinformatics, Arthur M. Lesk, 2002, Oxford University Press
• Instant Notes in Bioinformatics, D.R. Westhead, J. H. Parish, R.M. Twyman, 2002, Bios Scientific Pub
• Fundamental Concepts of Bioinformatics, Dan E. Krane, Michael L. Raymer, Michaeel L. Raymer, Elaine Nicpon Marieb, 2002, Benjamin/Cummings
• Essentials of Genomics and Bioinformatics, C. W. Sensen (Editor), 2002, John Wiley & Sons
• Current Topics in Computational Molecular Biology (Computational Molecular Biology), Tao Jiang, Ying Xu, Michael Zhang (Editors), 2002, MIT Press
• Hidden Markov Models for Bioinformatics, Timo Koski, Timo Koskinen, 2001, Kluwer Academic Publishers
• Bioinformatics: From Genomes to Drugs, Thomas Lengauer (Editor), 2001, John Wiley & Sons
• Statistical Methods in Bioinformatics: An Introduction (Statistics for Biology and Health), Warren Ewens, Gregory Grant, 2001, Springer Verlag
• Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins, Second Edition, Andreas D. Baxevanis, B. F. Francis Ouellette, 2001, Wiley-Interscience
• Bioinformatics: The Machine Learning Approach, Second Edition (Adaptive Computation and Machine Learning), Pierre Baldi, Soren Brunak, Sren Brunak, 2001, MIT Press
• Introduction to Bioinformatics, T eresa Attwood, David Parry-Smith, 2001, Prentice Hall
• Bioinformatics: A Primer, Charles Staben, 2001, Jones & Bartlett Pub
• Data Analysis and Classification for Bioinformatics, Arun Jagota, 2000, AKJ Academics
• Bioinformatics: Sequence and Genome Analysis, David W. Mount, 2001, Cold Spring Harbor Laboratory Press
• Bioinformatics: A Biologist's Guide to Biocomputing and the Internet, Stuart M. Brown, 2000, Eaton Pub Co
• Bioinformatics: Sequence, Structure and Databanks: A Practical Approach (The Practical Approach Series, 236), Des Higgins (Editor), Willie Taylor (Editor), 2000, Oxford Univ Press
• Neural Networks and Genome Informatics, Cathy H. Wu, Jerry W. McLarty, 2000, Elsevier Science
• Computational Molecular Biology: An Introduction (Wiley Series in Mathematical and Computational Biology), Peter Clote and Rolf Backofen, 2000, John Wiley & Sons
• Computational Molecular Biology: An Algorithmic Approach, Pavel A. Pevzner, 2000, MIT Press
• Post-Genome Informatics, Minoru Kanehisa, 2000, Oxford Univ Press
• Mathematical and Computational Biology: Computational Morphogenesis, Hierarchical Complexity, and Digital Evolution, Chrystopher L. Nehaniv, 1999, American Mathematical Society
• Pattern Discovery in Biomolecular Data: Tools, Techniques, and Applications, Jason T. L. Wang, Bruce A. Shapiro, Dennis Elliott Shasha (Editors), 1999, Oxford Univ Press
• Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, David Sankoff and Joseph Kruskal (Editors), 1999, Cambridge University Press
• Bioinformatics Basics: Applications in Biological Science and Medicine, Hooman Rashidi, 1999, CRC Press
• Bioinformatics: Methods and Protocols (Methods in Molecular Biology, Vol 132), Stephen Misener and Stephen A. Krawetz (Editors),1999, Humana Press
• Bioinformatics: Databases and Systems, Stanley Letovsky (Editor),1999, Kluwer Academic Publishers
• Computational Molecular Biology, P. Green, 1998, Blackwell Science Inc.
• Computational Methods in Molecular Biology (New Comprehensive Biochemistry, V. 32), Steven L. Salzberg, David B. Searls, Simon Kasif (Editors), 1998, Elsevier Science Ltd.
• Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Richard Durbin, S. Eddy, A. Krogh, G. Mitchison, 1998, Cambridge University Press
• Guide to Human Genome Computing, M. J. Bishop (Editor), 1998, Academic Press
• Introduction to Computational Molecular Biology, Joao Meidanis, Joao C. Setabal, 1997, PWS Pub. Co.
• Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Dan Gusfield, 1997, Cambridge University Press
• Sequence Data Analysis Guidebook, Simon R. Swindell (Editor), 1997, Humana Press
• High Performance Computational Methods for Biological Sequence Analysis, Tieng K. Yap, Ophir Frieder, Robert L. Martino, 1996, Kluwer Academic Pub.
• Computer Methods for Macromolecular Sequence Analysis, Methods in Enzymology, volume 266, Russell F. Doolittle (Editor), 1996, Academic Press
• DNA and Protein Sequence Analysis: A Practical Approach (Practical Approach Series , No 171), 1996, M. J. Bishop and C. J. Rawlings (Editors), 1996, IRL Press
• Molecular Bioinformatics: Algorithms and Applications, Steffen Schulze-Kremer, 1995, Walter De Gruyter
• Introduction to Computational Biology - Maps, sequences and genomes, Michael S. Waterman, 1995, Chapman & Hall
• Computer Analysis of Sequence Data, Annette M. Griffin and Hugh G. Griffin (Editors), 1994, Humana Press
• Artificial Intelligence and Molecular Biology, Lawrence Hunter (Editor), 1993, AAAI Press
• Sequence Analysis Primer, Michael Gribskov and John Devereux (Editors), 1992, Oxford University Press
• Mathematical Methods of Analysis of Biopolymer Sequences (Dimacs Series in Discrete Mathematics and Theoretical Computer Science ; Volume 8), S. G. Gindikin, 1992, American Mathematical Society
• Mathematical Methods for DNA Sequences, Michael S. Waterman (Editor), 1989, CRC Press

Programming Books for Bioinformatics

• Mastering Perl for Bioinformatics, James D. Tisdall, 2003, O'Reilly
• Genomic Perl: From Bioinformatics Basics to Working Code, Rex A. Dwyer, 2002, Cambridge University Press
• Beginning Perl for Bioinformatics, James Tisdall, 2001, O'Reilly
• Developing Bioinformatics Computer Skills, Cynthia Gibas, Per Jambeck, 2001, O'Reilly

General Genomics

• Functional Microbial Genomics (Volume 33), Brendan Wren, Nick Dorrell, 2003, Academic Press
• Discovering Genomics, Proteomics, and Bioinformatics, A. Malcolm Campbell, Laurie J. Heyer, 2002, Benjamin/Cummings
• Genomes, Terence A. Brown, 2002, John Wiley & Sons
• Essentials of Medical Genomics, Stuart M. Brown , 2002, John Wiley & Sons
• A Primer of Genome Science, Greg Gibson, Spencer V. Muse, 2002, Sinauer Associates
• Pathogen Genomics: Impact on Human Health, Karen Joy, Phd Shaw (Editors), 2002, Humana Press
• Genomics, John E. Antonopoulos, 2000, Xlibris Corporation
• Genomics and Proteomics: Functional and Computational Aspects, Sandor Suhai (Editor), 2000, Plenum Pub Corp
• Functional Genomics: A Practical Approach (The Practical Approach Series, 235), S. Hunt and F. Livesey (Editors), 2000, Oxford Univ Press
• Human Molecular Genetics, Andrew P. Read, Tom Strachan 1999, BIOS Scientific Publishers Ltd.
• Genomics: The Science and Technology Behind the Human Genome Project, Charles R. Cantor and Cassandra L. Smith, 1999, John Wiley & Sons
• Cells: A Laboratory Manual, 3 volumes, David L. Spector, Robert D. Goldman, Leslie A. Leinwand, 1998, Cold Spring Harbor Laboratory Press
• Genome Analysis: A Laboratory Manual, 4 volumes, Bruce Birren, et al. (Editors), 1997, Cold Spring Harbor Laboratory Press
• The Human Genome Project, N. G. Cooper (Editor), 1994, University Science Books

Comparative Genomics

• Handbook of Comparative Genomics: Principles and Methodology, Cecilia Saccone, Graziano Pesole, 2003, Wiley-Liss
• Sequence - Evolution - Function: Computational Approaches in Comparative Genomics, Eugene V. Koonin, Michael Y. Galperin, 2002, Kluwer Academic Publishers
• Comparative Genomics - Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families, David Sankoff and Joseph H. Nadeau, 2000, Kluwer Academic Pub
• Comparative Genomics, Melody Clark (Editor), 2000, Kluwer Academic Pub

Proteomics

• Proteins and Proteomics: A Laboratory Manual, Richard J. Simpson (Editor), Cold Spring Harbor Laboratory
• Proteomics in Practice: A Laboratory Manual of Proteome Analysis , Reiner Westermeier, Tom Naven, 2002, John Wiley & Sons
• Posttranslational Modifications of Proteins: Tools for Functional Proteomics (Methods in Molecular Biology, Vol 194) , Christoph Kannicht (Editor), 2002, Humana Press
• Peptide Arrays on Membrane Supports: Synthesis and Applications (Springer Lab Manual), Joachim Koch, Michael Mahler (Editors), 2002, Springer Verlag
• Proteomics , Timothy Palzkill, 2002, Kluwer Academic Publishers
• Introduction to Proteomics: Tools for the New Biology , Daniel C. Liebler (Editor), 2001, Humana Press
• Proteome Research: Mass Spectrometry (Principles and Practice) , P. James (Editor), 2001, Springer Verlag
• Interpreting Protein Mass Spectra: A Comprehensive Resource , A. Peter Snyder, 2000, American Chemical Society
• Protein Sequencing and Identification Using Tandem Mass Spectrometry , Michael Kinter, Nicholas E. Sherman, 2000, Wiley-Interscience
• From Genome to Proteome: Advances in the Practice and Application of Proteomics, Michael J. Dunn (Editor), 2000, Vch Verlagsgesellschaft Mbh
• Proteomics: From Protein Sequence to Function, S. Pennington (Editor), M. Dunn (Editor), 2000, Springer Verlag
• Proteome Research: Two-Dimensional Gel Electrophoresis and Detection Methods (Principles and Practice), T. Rabilloud (Editor), 2000, Springer Verlag
• Proteome and Protein Analysis, R. M. Kamp, D. Kyriakidis, th Choli-Papadopoulou (Editor), 1999, Springer Verlag
• Proteome Research: New Frontiers in Functional Genomics, M. R. Wilkins, et al. (Editors), 1997, Springer Verlag

Protein Structure

• Structural Bioinformatics, Philip E. Bourne, Helge Weissig (Editors), 2003, John Wiley & Sons
• Protein Structure Prediction: Bioinfomatic Approach, I.F. Tsigelny, 2002, International University Line
• Introduction to Protein Architecture: The Structural Biology of Proteins, Arthur M. Lesk, 2001, Oxford University Press
• Protein Structure Prediction: Methods and Protocols, David M. Webster (Editor), 2000, Humana Press
• Introduction to Protein Structure, Carl-Ivar Branden, John Tooze, 1999, Garland Publishing
• Structure and Mechanism in Protein Science: A Guide to Enzyme Catalysis and Protein Folding, Alan Fersht, 1999, Freeman

Pharmacogenomics

• Pharmacogenomics: Social, Ethical, and Clinical Dimensions, Mark A. Rothstein (Editor), 2003, Wiley-Liss
• Pharmacogenomics: The Search for Individualized Therapies, Julio Licinio, Ma-Li Wong (Editors), 2002, John Wiley & Sons
• Pharmacogenomics, Werner Kalow, Urs A. Meyer, Rachel Tyndale (Editors), 2001, Marcel Dekker
• Pharmacogenetics and Pharmcogenomics: Recent Conceptual and Technical Advances (Pharmacology, Volume 61, Number 3, 2000), Elliot S. Vesell (Editor), 2000, S. Karger Publishing
• Pharmacogenetics, Wendell Weber, 1997, Oxford University Press

DNA Microarrays

• Statistical Analysis of Gene Expression Microarray Data, T. P. Speed (Editor), 2003, CRC Press
• Microarray Gene Expression Data Analysis: A Beginner's Guide, Helen C. Causton, John Quackenbush, Alvis Brazma, 2003, Blackwell Publishers
• The Analysis of Gene Expression Data (Statistics for Biology and Health), G. Parmigiani, E. S. Garrett, R. A. Irizarry, S. Zeger , Graeme Clark (Editors), 2003, Springer Verlag
• A Practical Approach to Microarray Data Analysis, Daniel P. Berrar, Werner Dubitzky, Martin Granzow (Editors), 2002, Kluwer Academic Publishers
• DNA Microarrays and Gene Expression: From Experiments to Data Analysis and Modeling, Pierre Baldi, G. Wesley Hatfield, 2002, Cambridge University Press
• DNA Microarrays: A Molecular Cloning Manual, David Bowtell, Joseph Sambrook (Editors), 2002, Cold Spring Harbor Laboratory
• DNA Array Image Analysis: Nuts & Bolts, Gerda Kamberova, Shishir Shah, 2002, DNA Press
• Microarray Analysis, Mark Schena, 2002, John Wiley & Sons
• A Biologist's Guide to Analysis of DNA Microarray Data, Steen Knudsen, 2002, John Wiley & Sons
• Microarrays for an Integrative Genomics (Computational Molecular Biology), Isaac S. Kohane, Alvin Kho, Atul J. Butte, 2002, MIT Press
• Microarrays for the Neurosciences: An Essential Guide (Cellular and Molecular Neuroscience), Daniel H. Geschwind, Jeffrey P. Gregg (Editors), 2002, MIT Press
• DNA Microarrays: Gene Expression Applications, Bertrand Jordan (Editor), 2001, Springer Verlag
• DNA Arrays: Methods and Protocols (Methods in Molecular Biology, Volume 170), Jang B. Rampal (Editor), 2001, Humana Press
• DNA Arrays: Technologies and Experimental Strategies, Elena V. Grigorenko (Editor), 2001, CRC Press
• Microarray Biochip Technology, Mark Schena (Editor), 2000, Eaton Pub
• Expression Genetics: Accelerated and High-Throughput Methods (Biotechniques Update Series), Michael McClelland (Editor), Arthur B. Pardee (Editor), 1999, Eaton Pub
• DNA Microarrays: A Practical Approach (Practical Approach Series 205), Mark Schena (Editor), 1999, Oxford Univ Press
• cDNA Preparation and Characterization (Methods in Enzymology Volume 303), S.M. Weissman (Editor), 1999, Academic Press

Systems Biology, Genetic and Biochemical Network

• Handbook of Graphs and Networks : From the Genome to the Internet, Stefan Bornholdt, Heinz Georg Schuster (Editors), 2003, Vch Verlagsgesellschaft Mbh
• Computational Cell Biology, Christopher Fall, Eric Marland, John Wagner, John Tyson (Editors), 2002, Springer Verlag
• Gene Regulation and Metabolism: Post-Genomic Computational Approaches (Computational Molecular Biology), Julio Collado-Vides, Ralf Hofestadt (Editors), 2002, MIT Press
• Foundations of Systems Biology, Hiroaki Kitano (Editor), 2001, MIT Press
• Genomic Regulatory Systems: Development and Evolution, Eric H. Davidson , 2001, Academic Press
• Genes & Signals, Mark Ptashne, Alexander Gann, 2001, Cold Spring Harbor Laboratory
• Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology), James M. Bower and Hamid Bolouri (Editors), 2001, MIT Press
• Protein-Protein Interactions: A Molecular Cloning Manual, Erica Golemis (Editor), 2001, Cold Spring Harbor Laboratory
• Computational Analysis of Biochemical Systems: A Practical Guide for Biochemists and Molecular Biologists, Eberhard O. Voit, 2000, Cambridge University Press
• Mathematical Physiology, James P. Keener, James Sneyd, 1998, Springer Verlag

DNA Sequencing

• DNA Sequencing: From Experimental Methods to Bioinformatics (Introduction to Biotechniques Series), Luke Alphey, 1997, Springer Verlag
• Automated DNA sequencing and analysis, Adams M.D., Fields C., Venter J.C. (Editors), 1994, Academic Press

Apart from above mentioned books, you can also find some useful books links at following mentioned URLs:

http://www.amazon.com/Biological-Sequence-Analysis-Probabilistic-Proteins/dp/0521629713

http://www.amazon.com/Bioinformatics-Genes-Proteins-Computers-Advanced/dp/1859960545

http://www.amazon.com/Introduction-Bioinformatics-Algorithms-Computational-Molecular/dp/0262101068

http://books.google.no/books?id=pxSM7R1sdeQC&dq=Pierre+baldi+%2B+bioinformatics&printsec=frontcover&source=bn&hl=en&ei=IoGRS6uCIJT-NYLA8Z0N&sa=X&oi=book_result&ct=result&redir_esc=y#v=onepage&q&f=false

http://www.amazon.com/Statistical-Methods-Bioinformatics-Introduction-Statistics/dp/0387400826

If you think your favourite books are not listed then please write it down in comment section for the benefits of other users. Feel free to add many more books in comment section. 

Lab page @ http://krishna.gs.washington.edu/index.html

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

Genomics in India
www.ganitlabs.in
www.sandor.co.in
www.igib.res.in
www.genotypic.co.in
www.ocimumbio.com
www.abcgenomics.com
www.xcelrisgenomics.com
www.ayugen.com
www.geneombiotech.com

The genomics platform uses cancer genome sequencing and other high-throughput techniques to identify genes critical to the development of cancer and anomalies in the genomic profile of the tumours.

For more info visit : http://oicr.on.ca/

Analysis of regulatory sequences (RSAT project)
Classification and analysis of mobile genetic elements (ACLAME project).
Analysis of molecular interaction networks (NeAT project)
Inference of metabolic pathways from genomic and post-genomic data
(metabolic pathfinding, see also metabolic pathfinding in NeAT)
Critical assesment of protein interactions (CAPRI)

Lab Page http://www.bigre.ulb.ac.be/

Blog : http://blogs.plos.org/biologue/2012/12/28/translational-bioinformatics-plos-computational-biology-presents-an-educational-resource-for-an-emerging-field/

Educational Material : http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11

Address of the bookmark: http://www.ploscollections.org/article/browseIssue.action?issue=info:doi/10.1371/issue.pcol.v03.i11

More at >> http://www.baumbachlab.net/

More at http://changlab.stanford.edu/index.html