• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

109028, Moscow,
11, Pokrovsky boulevard

Phone: +7 (495) 531-00-00 *27254

Email: computerscience@hse.ru


First Deputy Dean Tamara Voznesenskaya
Deputy Dean for Research and International Relations Sergei Obiedkov
Deputy Dean for Methodical and Educational Work Ilya Samonenko
Deputy Dean for Development, Finance and Administration Irina Plisetskaya
Infinite transitivity, finite generation, and Demazure roots

Arzhantsev I., Kuyumzhiyan K., Zaidenberg M.

Advances in Mathematics. 2019. Vol. 351. P. 1-32.

Bias in False Discovery Rate Estimation in Mass-Spectrometry-Based Peptide Identification

Sulimov P., Voronkova A., Danilova Y. et al.

Journal of Proteome Research. 2019. Vol. 18. No. 5. P. 2354-2358.

Compression of recurrent neural networks for efficient language modeling

Grachev A., Ignatov D. I., Savchenko A.

Applied Soft Computing Journal. 2019. Vol. 79. P. 354-362.

Book chapter
Numerical Pattern Mining Through Compression

Makhalova T., Kuznetsov S., Napoli A.

In bk.: 2019 Data Compression Conference Proceedings. IEEE, 2019.

Mini-course «Introduction to String Algorithms». Prof. Gregory Kucherov, Paris-Est University at Marne-la-Vallée, France

Event ended

We would like to invite you to participate in a mini-course on Introduction to String Algorithms given by Prof. Gregory Kucherov.

The content of the course will include topics from the following list selected according to students' background and preferences:

·         Basic string algorithms: Knuth-Morris-Pratt, Rabin-Karp, Aho-Corasick

·         Text indexes. Suffix trees and its applications. Least Common Ancestor (LCA) and Range Minimum Queries (RMQ).

·         Lempel-Ziv compression.

·         Directed Acyclic Word Graph (DAWG), Position Heap

·         Suffix arrays

·         Succinct data structures. rank/select functions. Succinct tree representations.

·         Succinct text indexes. Burrows-Wheeler transform and BWT-index.

·         Approximate string search via dymanic programming.

·         Sequence alignment: Edit distance, Longest common subsequence, Needleman-Wunsch algorithm, Hirschberg's algorithm, Local alignment.

Gregory Kucherov received his PhD degree in computer science from the Russian Academy of Sciences in Novosibirsk in 1988 and a habilitation degree from Henri Poincaré University in Nancy, France, in 2000. He is presently a CNRS research director in Gaspard Monge Lab for Computer Science in Paris-Est University at Marne-la-Vallée, France, and is also affiliated with SkolTech where he teaches a course on efficient algorithms and data structures. His current research interests include algorithm design and engineering, algorithmic complexity, word combinatorics, data structures, sequence and graph algorithms with applications to bioinformatics and other big data applications.

When and where:

May 20, 13.40-16.30, room. 327 (3 Kochnovsky Proezd)

May 22, 13.40-16.30, room. 311 (3 Kochnovsky Proezd)

Language: English 

If you are interested to participate, please register here.