Combinatorial Pattern Matching, 18 June 2014, Moscow

18 June 2014

Moscow

Live broadcast on

This year the jubilee 25th Annual Symposium on Combinatorial Pattern Matching is taking place in Yandex’s Moscow office. The premier international event in the field of algorithms on strings, it is organised by the Higher School of Economics and will run for three days.

The conference begins with open lectures by renowned scientists Alberto Apostolico, Maxime Crochemore and Gene Myers. The abstracts can be read on the conference website.

Conference registration has closed, but it is still possible to attend the open lectures after completing the registration form. The open lectures are free of charge and will be held on June 16, from 9 am to 12:20 pm.

Those who are unable to attend can still watch Yandex’s live online video streaming of the event. Videos of all lectures will be published.

Where: 16, Leo Tolstoy St., Moscow, Extropolis conference hall

When: June 16-18

Conference language: English

Talks

08:00	Shortest Unique Substring Query Revisited		Watch
Combinatorial Pattern Matching Shortest Unique Substring Query Revisited 18 June, 08:0016, Leo Tolstoy St., Moscow Atalay Mert Ileri

08:00	Permuted Scaled Matching		Watch
Combinatorial Pattern Matching Permuted Scaled Matching 18 June, 08:0016, Leo Tolstoy St., Moscow Ayelet Butman

08:00	Hardness of Several String Indexing Problems		Watch
Combinatorial Pattern Matching Hardness of Several String Indexing Problems 18 June, 08:0016, Leo Tolstoy St., Moscow Jesper Sindahl Nielsen

08:00	Most Recent Match Queries in On-Line Suffix Trees		Watch
Combinatorial Pattern Matching Most Recent Match Queries in On-Line Suffix Trees 18 June, 08:0016, Leo Tolstoy St., Moscow N. Jesper Larsson

08:00	Order-preserving Pattern Matching with k Mismatches		Watch
Combinatorial Pattern Matching Order-preserving Pattern Matching with k Mismatches 18 June, 08:0016, Leo Tolstoy St., Moscow Pawel Gawrychowski

08:00	The Worst Case Complexity of Maximum Parsimony		Watch
Combinatorial Pattern Matching The Worst Case Complexity of Maximum Parsimony 18 June, 08:0016, Leo Tolstoy St., Moscow Amir Carmel

08:00	From Indexing Data Structures to de Bruijn Graphs		Watch
Combinatorial Pattern Matching From Indexing Data Structures to de Bruijn Graphs 18 June, 08:0016, Leo Tolstoy St., Moscow Eric Rivals

08:00	On the DCJ Median Problem		Watch
Combinatorial Pattern Matching On the DCJ Median Problem 18 June, 08:0016, Leo Tolstoy St., Moscow Mingfu Shao

08:00	Reversal Distances for Strings with Few Blocks or Small Alphabets		Watch
Combinatorial Pattern Matching Reversal Distances for Strings with Few Blocks or Small Alphabets 18 June, 08:0016, Leo Tolstoy St., Moscow Laurent Bulteau

08:00	Dictionary Matching with One Gap		Watch
Combinatorial Pattern Matching Dictionary Matching with One Gap 18 June, 08:0016, Leo Tolstoy St., Moscow B. Riva Shalom

08:00	An Improved Query Time for Succinct Dynamic Dictionary Matching		Watch
Combinatorial Pattern Matching An Improved Query Time for Succinct Dynamic Dictionary Matching 18 June, 08:0016, Leo Tolstoy St., Moscow Ariel Shiftan

08:00	String Range Matching		Watch
Combinatorial Pattern Matching String Range Matching 18 June, 08:0016, Leo Tolstoy St., Moscow Dominik Kempa

08:00	Computing Minimal and Maximal Suffixes of a Substring Revisited		Watch
Combinatorial Pattern Matching Computing Minimal and Maximal Suffixes of a Substring Revisited 18 June, 08:0016, Leo Tolstoy St., Moscow Tatiana Starikovskaya

08:00	Approximate String Matching Using a Bidirectional Index		Watch
Combinatorial Pattern Matching Approximate String Matching Using a Bidirectional Index 18 June, 08:0016, Leo Tolstoy St., Moscow Kamil Salikhov

08:00	A Really Simple Approximation of Smallest Grammar		Watch
Combinatorial Pattern Matching A Really Simple Approximation of Smallest Grammar 18 June, 08:0016, Leo Tolstoy St., Moscow Artur Jez

08:00	On Combinatorial Generation of Prefix Normal Words		Watch
Combinatorial Pattern Matching On Combinatorial Generation of Prefix Normal Words 18 June, 08:0016, Leo Tolstoy St., Moscow Gabriele Fici

08:00	Sequence Comparison in the Time of Deluge		Watch
Combinatorial Pattern Matching Sequence Comparison in the Time of Deluge 18 June, 08:0016, Leo Tolstoy St., Moscow Alberto Apostolico

08:00	Repeats in Strings		Watch
Combinatorial Pattern Matching Repeats in Strings 18 June, 08:0016, Leo Tolstoy St., Moscow Maxime Crochemore

08:00	What's Behind BLAST		Watch
Combinatorial Pattern Matching What's Behind BLAST 18 June, 08:0016, Leo Tolstoy St., Moscow Gene Myers

08:00	Approximate On-line Palindrome Recognition, and Applications		Watch
Combinatorial Pattern Matching Approximate On-line Palindrome Recognition, and Applications 18 June, 08:0016, Leo Tolstoy St., Moscow Amihood Amir

08:00	Searching of Gapped Repeats and Subrepetitions in a Word		Watch
Combinatorial Pattern Matching Searching of Gapped Repeats and Subrepetitions in a Word 18 June, 08:0016, Leo Tolstoy St., Moscow Roman Kolpakov

08:00	Efficient Algorithms for Shortest Partial Seeds in Words		Watch
Combinatorial Pattern Matching Efficient Algorithms for Shortest Partial Seeds in Words 18 June, 08:0016, Leo Tolstoy St., Moscow Tomasz Kociumaka

08:00	Computing Palindromic Factorization and Palindromic Covers On-line		Watch
Combinatorial Pattern Matching Computing Palindromic Factorization and Palindromic Covers On-line 18 June, 08:0016, Leo Tolstoy St., Moscow Shiho Sugimoto

08:00	Optimal Encodings for Range Majority Queries		Watch
Combinatorial Pattern Matching Optimal Encodings for Range Majority Queries 18 June, 08:0016, Leo Tolstoy St., Moscow Gonzalo Navarro

08:00	Compressed Subsequence Matching and Packed Tree Coloring		Watch
Combinatorial Pattern Matching Compressed Subsequence Matching and Packed Tree Coloring 18 June, 08:0016, Leo Tolstoy St., Moscow Patrick Hagge Cording

08:00	Compactness-Preserving Mapping on Trees		Watch
Combinatorial Pattern Matching Compactness-Preserving Mapping on Trees 18 June, 08:0016, Leo Tolstoy St., Moscow Jiong Guo

08:00	Indexed Geometric Jumbled Pattern Matching		Watch
Combinatorial Pattern Matching Indexed Geometric Jumbled Pattern Matching 18 June, 08:0016, Leo Tolstoy St., Moscow Travis Gagie

08:00	Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence		Watch
Combinatorial Pattern Matching Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence 18 June, 08:0016, Leo Tolstoy St., Moscow Tomasz Kociumaka

Combinatorial Pattern Matching

Talks

Combinatorial Pattern Matching

Shortest Unique Substring Query Revisited

Combinatorial Pattern Matching

Permuted Scaled Matching

Combinatorial Pattern Matching

Hardness of Several String Indexing Problems

Combinatorial Pattern Matching

Most Recent Match Queries in On-Line Suffix Trees

Combinatorial Pattern Matching

Order-preserving Pattern Matching with k Mismatches

Combinatorial Pattern Matching

The Worst Case Complexity of Maximum Parsimony

Combinatorial Pattern Matching

From Indexing Data Structures to de Bruijn Graphs

Combinatorial Pattern Matching

On the DCJ Median Problem

Combinatorial Pattern Matching

Reversal Distances for Strings with Few Blocks or Small Alphabets

Combinatorial Pattern Matching

Dictionary Matching with One Gap

Combinatorial Pattern Matching

An Improved Query Time for Succinct Dynamic Dictionary Matching

Combinatorial Pattern Matching

String Range Matching

Combinatorial Pattern Matching

Computing Minimal and Maximal Suffixes of a Substring Revisited

Combinatorial Pattern Matching

Approximate String Matching Using a Bidirectional Index

Combinatorial Pattern Matching

A Really Simple Approximation of Smallest Grammar

Combinatorial Pattern Matching

On Combinatorial Generation of Prefix Normal Words

Combinatorial Pattern Matching

Sequence Comparison in the Time of Deluge

Combinatorial Pattern Matching

Repeats in Strings

Combinatorial Pattern Matching

What's Behind BLAST

Combinatorial Pattern Matching

Approximate On-line Palindrome Recognition, and Applications

Combinatorial Pattern Matching

Searching of Gapped Repeats and Subrepetitions in a Word

Combinatorial Pattern Matching

Efficient Algorithms for Shortest Partial Seeds in Words

Combinatorial Pattern Matching

Computing Palindromic Factorization and Palindromic Covers On-line

Combinatorial Pattern Matching

Optimal Encodings for Range Majority Queries

Combinatorial Pattern Matching

Compressed Subsequence Matching and Packed Tree Coloring

Combinatorial Pattern Matching

Compactness-Preserving Mapping on Trees

Combinatorial Pattern Matching

Indexed Geometric Jumbled Pattern Matching

Combinatorial Pattern Matching

Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence