|
Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://www.mccme.ru/albio/program.html
Дата изменения: Fri Jun 30 19:44:08 2006 Дата индексирования: Mon Oct 1 22:07:09 2012 Кодировка: Поисковые слова: asteroid |
|
Day 1 - July 11 |
| 10:00 | 10:40 | Opening session | |
|---|---|---|---|
| 10:40 | 11:40 | M.S.Gelfand | Comparative genomics. Problems and approaches. |
| 12:00 | 12:50 | D. Brown. | Optimization and algebra in haplotype inference. |
| 13:10 | 14:00 | A. Shen. | The complexity of constructive objects. |
| 15:30 | 16:20 | N.Przulj. | Comparing and Modeling Protein-Protein Interaction Networks. |
| 16:30 | 18:00 | Discussion | |
|
Day 2 - July 12 |
| 10:00 | 11:00 | V.Yu. Makeev | Algorithms for motif search. |
| 11:20 | 12:10 | B.Morgenstern | Gene structure prediction in eukaryotes using heterogeneous sources of information. |
| 12:30 | 13:20 | E. Ukkonen | Computational methods for haplotype reconstruction and for enhancer element prediction. |
| 13:30 | 14:00 | V. Boeva | Statistical Measures of Significant Representation of Motifs and Motif Combinations. |
| 15:30 | 16:00 | O. Rokhlenko | Flux Based vs. Topology Based Similarity of Metabolic Genes. |
| 16:00 | 16:30 | A. Favorov | Markov chain Monte Carlo models for identification of significant combination of patterns. |
| 16:50 | 18:00 | Discussion | |
|
Day 3 - July 13 |
| 10:00 | 11:00 | A.V.Finkelstein | Protein physics. |
| 11:20 | 12:10 | A.R. Rubinov | Cluster methods in bioinformatics. |
| 12:30 | 13:20 | S. Nechaev | Longest common subsequence of two random sequences. |
| 13:30 | 14:00 | Y Wexler | A Study of Accessible Motifs and RNA Folding Complexity. |
| 15:30 | 16:00 | A. Loskutov | What Can We Learn About Genom From 2-D DNA Walk? |
| 16:00 | 16:30 | V. A. Sorokin | Efficient approach to the delineation of permuted domains in sequences of homologous proteins. |
| 16:50 | 18:00 | Discussion | |
|
Extra |