Difference between revisions of "Lecture 01"
Jump to navigation
Jump to search
(21 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | <div style="padding: 5px; background: #FF4560; border:solid 2px #000000;"> | + | <!-- div style="padding: 5px; background: #FF4560; border:solid 2px #000000;"> |
'''Update Warning!''' | '''Update Warning!''' | ||
This page has not been revised yet for the 2007 Fall term. Some of the slides may be reused, but please consider the page as a whole out of date as long as this warning appears here. | This page has not been revised yet for the 2007 Fall term. Some of the slides may be reused, but please consider the page as a whole out of date as long as this warning appears here. | ||
− | </div> | + | </div --> |
| | ||
Line 13: | Line 13: | ||
==Organisation and Orientation== | ==Organisation and Orientation== | ||
+ | |||
+ | ;What you should take home from this lecture: | ||
+ | * Bioinformatics is a science between the two poles of data management and biological modeling. | ||
+ | * It is a young, rapidly changing field | ||
+ | * To succeed in this course: attend the lectures and digest the material in your class notes, participate actively in discussions in class and online, explore resources on your own and make sure you understand the assignments! | ||
+ | * And most importantly: '''If there is anything you don't understand, don't let it pass!''' | ||
+ | |||
+ | | ||
+ | |||
+ | ;Links summary: | ||
+ | * [http://www.ncbi.nlm.nih.gov '''NCBI'''] (National Center of Biotechnology Information) | ||
+ | * [http://www.pdb.org '''PDB'''] (Protein structure DataBase) | ||
+ | * [http://www.genome.jp/kegg/ '''KEGG'''] (the Kyoto Encyclopedia of Genes and Genomes) | ||
+ | * [http://biochemistry.utoronto.ca/undergraduates/courses/BCH441H/resources/FinkAndMaoTieKnots.pdf Fink and Mao, 1999], Nature, 398:31-32 (pdf) | ||
+ | * [http://en.wikipedia.org/wiki/Cargo_cult_science Cargo Cult Science] on Wikipedia | ||
+ | * Special issue on [http://nar.oxfordjournals.org/content/vol35/suppl_1/index.dtl 2007 '''databases'''], published by NAR | ||
+ | * Special issue on [http://nar.oxfordjournals.org/content/vol35/suppl_2/index.dtl 2007 '''Web services'''], published by NAR | ||
+ | * [http://bioinformatics.org The Bioinformatics Organization] | ||
+ | * [http://www.gchelpdesk.ualberta.ca/ Genome Canada Bioinformatics Help Desk] | ||
+ | * [http://bioinformatics.ca bioinformatics.ca], host of the Canadian Bioinformatics Workshop series | ||
+ | * [http://iscb.org '''ISCB'''] The International Society for Computational Biology | ||
− | |||
− | |||
− | |||
− | |||
− | |||
==Lecture Slides== | ==Lecture Slides== | ||
Line 48: | Line 64: | ||
======Slide 006====== | ======Slide 006====== | ||
[[Image:L01_s006.jpg|frame|none|Lecture 01, Slide 006<br> | [[Image:L01_s006.jpg|frame|none|Lecture 01, Slide 006<br> | ||
− | The US [http://www.ncbi.nlm.nih.gov National Center of Biotechnology Information] is one of the world's major centres for molecular data. | + | The US [http://www.ncbi.nlm.nih.gov NCBI (National Center of Biotechnology Information)] is one of the world's major centres for molecular data. |
]] | ]] | ||
Line 72: | Line 88: | ||
======Slide 011====== | ======Slide 011====== | ||
[[Image:L01_s011.jpg|frame|none|Lecture 01, Slide 011<br> | [[Image:L01_s011.jpg|frame|none|Lecture 01, Slide 011<br> | ||
+ | Tying ties may be at first an intimidatingly imprecise task, and indeed irrelevant. (Half of North Americans are not eligible to wear a tie, even to formal occasions, and those of the other half who are not working in a bank will maybe wear a tie on only two occasions and have the tie tied for them on the second one. Tying ties is, alas, a cultural technique that appears to be on the decline.). But it is a nice example for abstracting a complicated process down to its essential principles, and ''reasoning formally'' about these principles to obtain ''rigorous results'' about the process. | ||
+ | <p> | ||
+ | Here is an example of a systematic, albeit informal description of the process of how to tie a tie. But why is the process divided into exactly these steps? Are all of them necessary? How do we describe this process so that we can remember it ? Or do we need to refer to the sequence of images every time we would like to tie this knot? Is this a simple, or a rather complicated way to tie a tie; are there others? Are there better ways to tie a tie, and what could ''better'' even mean? | ||
+ | ]] | ||
− | |||
======Slide 012====== | ======Slide 012====== | ||
[[Image:L01_s012.jpg|frame|none|Lecture 01, Slide 012<br> | [[Image:L01_s012.jpg|frame|none|Lecture 01, Slide 012<br> | ||
+ | The triangular lattice walk transposes the problem from your neck into the domain of mathematics ! | ||
+ | ]] | ||
− | |||
======Slide 013====== | ======Slide 013====== | ||
[[Image:L01_s013.jpg|frame|none|Lecture 01, Slide 013<br> | [[Image:L01_s013.jpg|frame|none|Lecture 01, Slide 013<br> | ||
Line 84: | Line 104: | ||
======Slide 014====== | ======Slide 014====== | ||
[[Image:L01_s014.jpg|frame|none|Lecture 01, Slide 014<br> | [[Image:L01_s014.jpg|frame|none|Lecture 01, Slide 014<br> | ||
+ | How many alternatives do we have to consider, if we allow maximally nine moves and require at least three for the finishing moves? We noted previously that there are two possibilities for the three finishing moves (LRC or RLC). Since moves cannot repeat into the same sector, each of the possibilities can only have been preceded by two alternatives i.e.. (CLRC or RLRC) and (CRLC or LRLC). These four possibilities again can have been preceded by two alternatives each ... etc. Since we treat knots of different move-numbers as distinct, the total number of moves up to length L is the sum of all powers of 2 up to (L-2). (-2 because of the finishing moves!). You should be able to figure out reasoning like this on your own! | ||
+ | ]] | ||
− | |||
======Slide 015====== | ======Slide 015====== | ||
[[Image:L01_s015.jpg|frame|none|Lecture 01, Slide 015<br> | [[Image:L01_s015.jpg|frame|none|Lecture 01, Slide 015<br> | ||
+ | It is not uncommon for models to be bounded by constraints. Here we define '''metrics''' for symmetry and balance and we can then use '''parameters''' to judge whether certain of the 254 possible walks are acceptable or not. (Details omitted, refer to the original paper of [http://biochemistry.utoronto.ca/undergraduates/courses/BCH441H/resources/FinkAndMaoTieKnots.pdf Fink and Mao, 1999, Nature, 398:31-32 (pdf)]). | ||
+ | ]] | ||
− | |||
======Slide 016====== | ======Slide 016====== | ||
[[Image:L01_s016.jpg|frame|none|Lecture 01, Slide 016<br> | [[Image:L01_s016.jpg|frame|none|Lecture 01, Slide 016<br> | ||
+ | The algorithm to creat all knots, finally, requires no more than exhaustive enumeration. What is important is to note the word "exhaustive". The result is complete, in the sense that every way to tie a tie has been captured. What is not in this list, cannot exist (under the assumptions the models makes). If this reminds you of the concept of "complete information" in the sequence of a genome, this is intended. | ||
+ | ]] | ||
− | |||
======Slide 017====== | ======Slide 017====== | ||
[[Image:L01_s017.jpg|frame|none|Lecture 01, Slide 017<br> | [[Image:L01_s017.jpg|frame|none|Lecture 01, Slide 017<br> | ||
Line 104: | Line 127: | ||
======Slide 019====== | ======Slide 019====== | ||
[[Image:L01_s019.jpg|frame|none|Lecture 01, Slide 019<br> | [[Image:L01_s019.jpg|frame|none|Lecture 01, Slide 019<br> | ||
+ | While data technologies' goals and endpoints are obvious and straightforward to define, the same does not hold true for the modeling aspect of bioinformatics. Models cannot be derived directly from an observation of the data! They require insight, judgment and a sense of perspective and direction. If the modeling exercise does not lead to valuable and testable conclusions, it is pointless. | ||
+ | ]] | ||
− | |||
======Slide 020====== | ======Slide 020====== | ||
[[Image:L01_s020.jpg|frame|none|Lecture 01, Slide 020<br> | [[Image:L01_s020.jpg|frame|none|Lecture 01, Slide 020<br> | ||
+ | From Feynman's 1974 Caltech commencement address (e.g. see ''[http://en.wikipedia.org/wiki/Cargo_cult_science Cargo Cult Science]'' on Wikipedia). | ||
+ | <p> | ||
+ | But what are the ''airplanes'' of bioinformatics in the first place? And how do we construct strategies of scientific enquiry that not only include the ''airplanes'' but that also make them land? | ||
+ | ]] | ||
− | |||
======Slide 021====== | ======Slide 021====== | ||
[[Image:L01_s021.jpg|frame|none|Lecture 01, Slide 021<br> | [[Image:L01_s021.jpg|frame|none|Lecture 01, Slide 021<br> | ||
+ | Examples of possible value derived from bioinformatic analysis. Note that ''value'' is to be understood not necessarily as a purely economic term - ethical advances and purely scientific insight are certainly valuable! | ||
+ | ]] | ||
− | |||
======Slide 022====== | ======Slide 022====== | ||
[[Image:L01_s022.jpg|frame|none|Lecture 01, Slide 022<br> | [[Image:L01_s022.jpg|frame|none|Lecture 01, Slide 022<br> | ||
Line 120: | Line 148: | ||
======Slide 023====== | ======Slide 023====== | ||
[[Image:L01_s023.jpg|frame|none|Lecture 01, Slide 023<br> | [[Image:L01_s023.jpg|frame|none|Lecture 01, Slide 023<br> | ||
+ | Taken from the [http://nar.oxfordjournals.org/content/vol35/suppl_1/index.dtl 2007 special issue on databases, published by NAR]. | ||
+ | <p> | ||
+ | By the time it takes you to study the existing databases, the majority will have seen significant updates and upgrades, gone out of existence or been superseded by more appropriate resources. | ||
]] | ]] | ||
+ | |||
======Slide 024====== | ======Slide 024====== | ||
[[Image:L01_s024.jpg|frame|none|Lecture 01, Slide 024<br> | [[Image:L01_s024.jpg|frame|none|Lecture 01, Slide 024<br> | ||
+ | Taken from the [http://nar.oxfordjournals.org/content/vol35/suppl_2/index.dtl 2007 special issue on Web services, published by NAR]. | ||
+ | <p> | ||
+ | The same holds for Web-services: it may be possible to find a service to do a particular task, it is virtually impossible to determine whether the suggested procedure can be considered "state-of-the-art" at the time you need to do your analysis. | ||
]] | ]] | ||
+ | |||
======Slide 025====== | ======Slide 025====== | ||
[[Image:L01_s025.jpg|frame|none|Lecture 01, Slide 025<br> | [[Image:L01_s025.jpg|frame|none|Lecture 01, Slide 025<br> | ||
Line 168: | Line 204: | ||
======Slide 035====== | ======Slide 035====== | ||
[[Image:L01_s035.jpg|frame|none|Lecture 01, Slide 035<br> | [[Image:L01_s035.jpg|frame|none|Lecture 01, Slide 035<br> | ||
+ | The amount of information that can be found by a Google search on a given topic is quite impressive. Some of the material is actually also very good. | ||
+ | ]] | ||
− | |||
======Slide 036====== | ======Slide 036====== | ||
[[Image:L01_s036.jpg|frame|none|Lecture 01, Slide 036<br> | [[Image:L01_s036.jpg|frame|none|Lecture 01, Slide 036<br> | ||
+ | [http://bioinformatics.ca bioinformaticsw.ca - host of the Canadian Bioinformatics Workshop series] - all lecture material online under a Creative Commons license. | ||
+ | ]] | ||
− | |||
======Slide 037====== | ======Slide 037====== | ||
[[Image:L01_s037.jpg|frame|none|Lecture 01, Slide 037<br> | [[Image:L01_s037.jpg|frame|none|Lecture 01, Slide 037<br> | ||
+ | [http://bioinformatics.org The Bioinformatics Organization] | ||
+ | <p> | ||
+ | Browse the archives of the BioBB mailing list - it may be quite useful to subscribe to get a better idea of what's going on in the field. | ||
]] | ]] | ||
+ | |||
======Slide 038====== | ======Slide 038====== | ||
[[Image:L01_s038.jpg|frame|none|Lecture 01, Slide 038<br> | [[Image:L01_s038.jpg|frame|none|Lecture 01, Slide 038<br> | ||
+ | [http://www.gchelpdesk.ualberta.ca/ Genome Canada Bioinformatics Help Desk] | ||
+ | ]] | ||
− | |||
======Slide 039====== | ======Slide 039====== | ||
[[Image:L01_s039.jpg|frame|none|Lecture 01, Slide 039<br> | [[Image:L01_s039.jpg|frame|none|Lecture 01, Slide 039<br> | ||
+ | [http://iscb.org The International Society for Computational Biology] (among other activities) host ISMB - the world's largest bioinformatics conference: the next one will be July 19-23 2008 in '''Toronto'''. | ||
+ | ]] | ||
− | |||
======Slide 040====== | ======Slide 040====== | ||
[[Image:L01_s040.jpg|frame|none|Lecture 01, Slide 040<br> | [[Image:L01_s040.jpg|frame|none|Lecture 01, Slide 040<br> | ||
Line 194: | Line 238: | ||
]] | ]] | ||
+ | |||
+ | |||
+ | |||
+ | | ||
+ | ---- | ||
+ | <small>[[Lecture_02|(Next lecture)]]</small> |
Latest revision as of 14:58, 19 September 2007
Organisation and Orientation
- What you should take home from this lecture
- Bioinformatics is a science between the two poles of data management and biological modeling.
- It is a young, rapidly changing field
- To succeed in this course: attend the lectures and digest the material in your class notes, participate actively in discussions in class and online, explore resources on your own and make sure you understand the assignments!
- And most importantly: If there is anything you don't understand, don't let it pass!
- Links summary
- NCBI (National Center of Biotechnology Information)
- PDB (Protein structure DataBase)
- KEGG (the Kyoto Encyclopedia of Genes and Genomes)
- Fink and Mao, 1999, Nature, 398:31-32 (pdf)
- Cargo Cult Science on Wikipedia
- Special issue on 2007 databases, published by NAR
- Special issue on 2007 Web services, published by NAR
- The Bioinformatics Organization
- Genome Canada Bioinformatics Help Desk
- bioinformatics.ca, host of the Canadian Bioinformatics Workshop series
- ISCB The International Society for Computational Biology
Lecture Slides
Slide 001
Slide 002
Slide 003
Slide 004
Slide 005
Slide 006
Slide 007
Slide 008
Slide 009
Slide 010
Slide 011
Slide 012
Slide 013
Slide 014
Slide 015
Slide 016
Slide 017
Slide 018
Slide 019
Slide 020
Slide 021
Slide 022
Slide 023
Slide 024
Slide 025
Slide 026
Slide 027
Slide 028
Slide 029
Slide 030
Slide 031
Slide 032
Slide 033
Slide 034
Slide 035
Slide 036
Slide 037
Slide 038
Slide 039
Slide 040
Slide 041