Scientific
American, June, 2003, pp. 76-81, "Chain letters and evolutionary
histories" by Charles H. Bennett, Ming Li, Bin Ma.
See here
for all the chain letters in our study.
"De genen van de kettingbrief" by Martijn van Calmthout,
De Volkskrant, Wetenschapsbijlage/5W, Saturday 21 June 2003.
New Scientist, November 6, 1999, pp. 44-47,
"On a Roll" by Dana Mackenzie on our work in Kolmogorov complexity;
You can download the article for free at
this site.
See here
for more comments on this.
Die Zeit
, April 13, 2000 (#16), p. 40: "Geometrisch Eingekreist" by Wolfgang Blum.
Courrier
International, December 23, 1999 -- January 5, 2000 (#41), p. 477-478: "Le h
asard ne joue pas aux de's", par Dana Mackenzie (translation NS article).
Bioinformatics: new challenges to computer science.
Beijing Bioinformatics Conference (Keynote Speaker).
Nov. 27, 2000, Beijing, China. (Organized by Academia Sinica and
Beijing Genomics Institute.)
Whole genome phylogeny,
Case Western Reserve-Netgenics-Athersys mini-symposium on
computational genetics, Cleveland, Oct. 20, 2000.
Shared information: genomes, documents, and programs.
Bioinformatics Workshop, Wayne State University, Detroit, Oct. 26, 2000.
Bioinformatics: new challenges to computer science.
ICS Conference. 3 hour tutorial. Taiwan, Dec. 5, 2000.
Professional activities:
Please visit our group homepage
Bioinformatics
group at Waterloo to see our people, publications, software,
and bioinformatics resources.
Here are some
photos
of our 2006 Christmas party.
We have a dynamic research group in bioinformatics.
We are recruiting brilliant students and post-docs
with strong algorithm, programming,
and molecular biology backgrounds. If you are strong
in at least two of these fields (and have some knowledge in the
third) and you are a dedicated worker, please send me an email.
CS798 2007, Fall Term
Kolmogorov complexity and applications. DC 3313, Mondays 4:30-7:00pm.
2007, Jan. 9, 11: Two Lectures presented in Shai Ben-David course.
Lecture 1
and
Lecture 2.
Assignment (1 hour): Consider an iid English text of length 100. At
each position, each letter from a to z appears independently with probability
1/26. Compute the probability of aaa and abc occuring in this text,
respectively. (Hint: you can do dynamic programming as in class, you can
also just do simulation to find the probabilities of aaa and abc.)
You can hand in this little assignment to my mailbox in the
CS main office area, by Jan. 25th.
Large Project: if you are interested in
doing larger projects related to bioinformatics, please email me.