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

125319, Moscow,
3 Kochnovsky Proezd (near metro station 'Aeroport'). 

Phone: +7 (495) 772-95-90 *12332

Email: computerscience@hse.ru



Dean Ivan Arzhantsev

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

Aug 26 – Aug 30
Registration and Poster Submission deadline — May 1, 2019 
On the prediction loss of the lasso in the partially labeled setting

Bellec P., Dalalyan A., Grappin E. et al.

Electronic journal of statistics. 2018. Vol. 12. No. 2. P. 3443-3472.

On the Structure of Ammann A2 Tilings
In press

Durand B., Shen A., Vereshchagin N.

Discrete and Computational Geometry. 2019. P. 1-30.

Ontology–based access to temporal data with ontop: a framework proposal

Zakharyaschev M. et al.

International Journal of Applied Mathematics and Computer Science. 2019. Vol. 29. No. 1. P. 17-30.

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.