Main.HomePage History

Hide minor edits - Show changes to markup

Changed line 1 from:

CS/ST580: bioinformatics algorithms

to:

CS/ST548: bioinformatics algorithms

Changed lines 3-5 from:

Fall 2011

Course description

to:

Fall 2011

Announcements

Class was moved from engineering E206 to CSB 325

Course description

Changed lines 10-12 from:

In homework assignments students will implement and use methods for analysis of protein/DNA sequences and other genomic information. The project component of the course will be centered around real biological data analysis problems, giving the student realistic experience in bioinformatics problem solving. When possible, students will be encouraged to work on their projects in interdisciplinary teams.

to:

In homework assignments students will implement and use methods for analysis of protein/DNA sequences and other genomic information. The project component of the course will be centered around real biological data analysis problems, giving the student realistic experience in bioinformatics problem solving.

Changed line 3 from:

Spring 2009

to:

Fall 2011

Changed lines 9-10 from:

The course is aimed at graduate students interested in bioinformatics. It is expected that students from computer science, statistics, and the life sciences will benefit from such a course. It will provide a broad overview of the computational and statistical techniques currently used in bioinformatics. Students will obtain in-depth understanding of standard bioinformatics tools and learn to use various sources of sequence data. The hands-on lab component of the course will consist of implementing and using methods for analysis of protein/DNA sequences and other genomic information. The project component of the course will be centered around real biological data analysis problems, giving the student realistic experience in bioinformatics problem solving. When possible, students will be encouraged to work on their projects in interdisciplinary teams.

to:

The course is aimed at graduate students interested in bioinformatics. It is expected that students from computer science, statistics, and the life sciences will benefit from such a course. It will provide a broad overview of the computational and statistical techniques currently used in bioinformatics. Students will obtain in-depth understanding of standard bioinformatics tools and learn to use various sources of sequence data. In homework assignments students will implement and use methods for analysis of protein/DNA sequences and other genomic information. The project component of the course will be centered around real biological data analysis problems, giving the student realistic experience in bioinformatics problem solving. When possible, students will be encouraged to work on their projects in interdisciplinary teams.

Changed line 1 from:

CS200: bioinformatics algorithms

to:

CS/ST580: bioinformatics algorithms

Changed lines 1-2 from:

CS200: algorithms and data structures

to:

CS200: bioinformatics algorithms

Spring 2009

Changed lines 7-10 from:

The goal of this course is to convey an understanding of abstract data types, common data structures, necessary discrete structures and complexity analysis. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graph algorithms. Complementary topics from theory include complexity analysis, recurrence relations, trees, and graphs.

to:

The past decade has seen an explosion of biological data, including the DNA sequence of a number of organisms. Computer science and statistics have an important role in analyzing these data: from assembling the genomic sequence, to predicting the protein-coding regions, their function and the manner in which they are regulated. The course will focus on biological sequence analysis, starting with the biological background, motivating the various computational problems, and methods for their solution. Computational techniques covered in the course include dynamic programming for sequence alignment, hidden Markov models for gene finding, and Gibbs sampling for motif discovery.

The course is aimed at graduate students interested in bioinformatics. It is expected that students from computer science, statistics, and the life sciences will benefit from such a course. It will provide a broad overview of the computational and statistical techniques currently used in bioinformatics. Students will obtain in-depth understanding of standard bioinformatics tools and learn to use various sources of sequence data. The hands-on lab component of the course will consist of implementing and using methods for analysis of protein/DNA sequences and other genomic information. The project component of the course will be centered around real biological data analysis problems, giving the student realistic experience in bioinformatics problem solving. When possible, students will be encouraged to work on their projects in interdisciplinary teams.

Deleted lines 3-4:

added someting

Added line 5:

added someting

Changed lines 1-12 from:

Welcome to PmWiki!

A local copy of PmWiki's documentation has been installed along with the software, and is available via the documentation index.

To continue setting up PmWiki, see initial setup tasks.

The basic editing page describes how to create pages in PmWiki. You can practice editing in the wiki sandbox.

More information about PmWiki is available from http://www.pmwiki.org .

to:

CS200: algorithms and data structures

Course description

The goal of this course is to convey an understanding of abstract data types, common data structures, necessary discrete structures and complexity analysis. The course is taught using the Java language and emphasizes an object oriented approach to data structures. Specific topics in data structures/algorithms include advanced sorting, queues, stacks, hashing, trees, and graph algorithms. Complementary topics from theory include complexity analysis, recurrence relations, trees, and graphs.