Блог пользователя aditya_sheth

Автор aditya_sheth, история, 5 лет назад, По-английски

Can someone tell how should I learn string-processing algorithms? I currently know only z-function. Where to start learning suffix-array, suffix-tree, suffix-automaton and also in what order. Also is there a good collection of question related to this topic.

  • Проголосовать: нравится
  • +13
  • Проголосовать: не нравится

»
5 лет назад, # |
Rev. 2   Проголосовать: нравится +16 Проголосовать: не нравится

Trie, kmp, aho, suffix array, suffix automaton, suffix tree.

Edit: Alright now that I have a bit more time a slightly more serious answer: solve stuff, look for string problems in educationals, they're quite decent and https://mirror.codeforces.com/gym/102302/problem/K

»
5 лет назад, # |
Rev. 2   Проголосовать: нравится +5 Проголосовать: не нравится

a good place to learn trie, you can also find some problems there

Some other trie problems: