Fwd: [Events] INVITATION: Institute Colloquium on December 3, 2012
6 views
Skip to first unread message
Saurabh Vashist
Nov 27, 2012, 2:43:43 AM11/27/12
to ics12...@googlegroups.com
---------- Forwarded message ----------
From: Public Relation Office <proo...@iitb.ac.in>
Date: Tue, Nov 27, 2012 at 10:23 AM
Subject: [Events] INVITATION: Institute Colloquium on December 3, 2012
To: eve...@iitb.ac.in, sem...@iitb.ac.in
----------------------------------------
IMPORTANT
To join the list send a mail to events-s...@iitb.ac.in
To leave the list send a mail to events-un...@iitb.ac.in
Policy on postings to this list is available at:
http://lists.iitb.ac.in/policies/EVENTS_policy.pdf
__________________________________________________________________
Your subscribed address in the mailing list Eve...@iitb.ac.in is 10d0...@iitb.ac.in
Messages may get discarded if you post from any other email address.
__________________________________________________________________
IIT Bombay is organising an Institute Colloquium on Monday, December 3,
2012. The details are as follows:
Title : Dirichlet Mixtures and the Probabilistic Structure of
Amino Acid Multinomial Space
Speaker : Dr. Stephen F. Altschul
Chairman, Computational Biology Branch
National Center for Biotechnology Information
National Library of Medicine
National Institutes of Health
Bethesda, USA
Day & Date : Monday, December 3, 2012
Time : 5.15 p.m.
Venue : Institute Auditorium
All are invited.
----------------------------------------------------------------------------
Abstract: A large number of faculty and research groups in the institute
are interested in different aspects of the application of Statistics and
Mathematics to solve problems in Biology, analyse data from
high-throughput techniques. This is a multi-disciplinary topic.
About the Speaker: Dr. Stephen F. Altschul received his degree in MA from
Harvard College, Cambridge, in 1979 and Ph.D. in Mathematics from
Massachusetts Institute of Technology, Cambridge, in 1987.
The paper entitled “Basic local alignment search tool” published by
Altschul (as first author) in 1990 has so far received 31,858 citations
(as of 4/10/12). The algorithm formulated in this article is commonly
known by its acronym BLAST. This acronym now is routinely used as a verb
to mean “searching a database for similar sequences”.
Subsequently, he (as first author) published a paper entitled
“Gapped-BLAST and PSI-BLAST: a new generation of protein database search
programs” in 1997. This has received 35,036 citations so far (as of
4/10/12). The PSI-BLAST algorithm continues to be an algorithm of choice
to detect remote homologs (i.e., genes which ancestry but have diverged
during evolution by accumulating a large number of mutations). Despite the
availability of a hidden Markov model-based profile search method which
probably is equally good, PSI-BLAST continues to be a preferred method.
Besides BLAST and PSI-BLAST, several other variants of the algorithm are
available now. These are essentially versions where the parameters have
been tweaked to suit different needs. This heuristic algorithm combines
sensitivity with speed and is one of the most widely used search
algorithm.
In addition to devising a heuristic method for rapidly searching through a
database of the ever-increasing size, there are two other contributions to
be critical to the immense success of BLAST: (i) Altschul provided a
statistical framework to estimate, with high accuracy, the probability
that the observes similarity in the sequences of the two proteins is due
to shared ancestry (as opposed to simply by chance). (ii) Working out a
method to introduce gaps in alignments.
----------------------------------------------------------------
PPR Section
Tel. NO. 4027
_______________________________________________
Events mailing list
Eve...@iitb.ac.in
http://lists.iitb.ac.in/mailman/listinfo/events
From: Public Relation Office <proo...@iitb.ac.in>
Date: Tue, Nov 27, 2012 at 10:23 AM
Subject: [Events] INVITATION: Institute Colloquium on December 3, 2012
To: eve...@iitb.ac.in, sem...@iitb.ac.in
----------------------------------------
IMPORTANT
To join the list send a mail to events-s...@iitb.ac.in
To leave the list send a mail to events-un...@iitb.ac.in
Policy on postings to this list is available at:
http://lists.iitb.ac.in/policies/EVENTS_policy.pdf
__________________________________________________________________
Your subscribed address in the mailing list Eve...@iitb.ac.in is 10d0...@iitb.ac.in
Messages may get discarded if you post from any other email address.
__________________________________________________________________
IIT Bombay is organising an Institute Colloquium on Monday, December 3,
2012. The details are as follows:
Title : Dirichlet Mixtures and the Probabilistic Structure of
Amino Acid Multinomial Space
Speaker : Dr. Stephen F. Altschul
Chairman, Computational Biology Branch
National Center for Biotechnology Information
National Library of Medicine
National Institutes of Health
Bethesda, USA
Day & Date : Monday, December 3, 2012
Time : 5.15 p.m.
Venue : Institute Auditorium
All are invited.
----------------------------------------------------------------------------
Abstract: A large number of faculty and research groups in the institute
are interested in different aspects of the application of Statistics and
Mathematics to solve problems in Biology, analyse data from
high-throughput techniques. This is a multi-disciplinary topic.
About the Speaker: Dr. Stephen F. Altschul received his degree in MA from
Harvard College, Cambridge, in 1979 and Ph.D. in Mathematics from
Massachusetts Institute of Technology, Cambridge, in 1987.
The paper entitled “Basic local alignment search tool” published by
Altschul (as first author) in 1990 has so far received 31,858 citations
(as of 4/10/12). The algorithm formulated in this article is commonly
known by its acronym BLAST. This acronym now is routinely used as a verb
to mean “searching a database for similar sequences”.
Subsequently, he (as first author) published a paper entitled
“Gapped-BLAST and PSI-BLAST: a new generation of protein database search
programs” in 1997. This has received 35,036 citations so far (as of
4/10/12). The PSI-BLAST algorithm continues to be an algorithm of choice
to detect remote homologs (i.e., genes which ancestry but have diverged
during evolution by accumulating a large number of mutations). Despite the
availability of a hidden Markov model-based profile search method which
probably is equally good, PSI-BLAST continues to be a preferred method.
Besides BLAST and PSI-BLAST, several other variants of the algorithm are
available now. These are essentially versions where the parameters have
been tweaked to suit different needs. This heuristic algorithm combines
sensitivity with speed and is one of the most widely used search
algorithm.
In addition to devising a heuristic method for rapidly searching through a
database of the ever-increasing size, there are two other contributions to
be critical to the immense success of BLAST: (i) Altschul provided a
statistical framework to estimate, with high accuracy, the probability
that the observes similarity in the sequences of the two proteins is due
to shared ancestry (as opposed to simply by chance). (ii) Working out a
method to introduce gaps in alignments.
----------------------------------------------------------------
PPR Section
Tel. NO. 4027
_______________________________________________
Events mailing list
Eve...@iitb.ac.in
http://lists.iitb.ac.in/mailman/listinfo/events
Saurabh Vashist
Internship Co-ordinator
Institute Placement Team 2012-13
Institute Placement Team 2012-13
Reply all
Reply to author
Forward
0 new messages