Yandex
Company
Jobs
Technologies
Events
Research
Log in
All events
Talks
Combinatorial Pattern Matching
01. Shortest Unique Substring Query Revisited
02. Permuted Scaled Matching
03. Hardness of Several String Indexing Problems
04. Most Recent Match Queries in On-Line Suffix Trees
05. Order-preserving Pattern Matching with k Mismatches
06. The Worst Case Complexity of Maximum Parsimony
07. From Indexing Data Structures to de Bruijn Graphs
08. On the DCJ Median Problem
09. Reversal Distances for Strings with Few Blocks or Small Alphabets
10. Dictionary Matching with One Gap
11. An Improved Query Time for Succinct Dynamic Dictionary Matching
12. String Range Matching
13. Computing Minimal and Maximal Suffixes of a Substring Revisited
14. Approximate String Matching Using a Bidirectional Index
15. A Really Simple Approximation of Smallest Grammar
16. On Combinatorial Generation of Prefix Normal Words
17. Sequence Comparison in the Time of Deluge
18. Repeats in Strings
19. What's Behind BLAST
20. Approximate On-line Palindrome Recognition, and Applications
21. Searching of Gapped Repeats and Subrepetitions in a Word
22. Efficient Algorithms for Shortest Partial Seeds in Words
23. Computing Palindromic Factorization and Palindromic Covers On-line
24. Optimal Encodings for Range Majority Queries
25. Compressed Subsequence Matching and Packed Tree Coloring
26. Compactness-Preserving Mapping on Trees
27. Indexed Geometric Jumbled Pattern Matching
28. Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
Dictionary Matching with One Gap
Combinatorial Pattern Matching
·
18 June 2014
B. Riva Shalom