Home

Welcome to the website!

Lectures

1. Lezione Introduttiva: Algoritmi Avanzati
2. KMP Algorithm and the Z-Algorithm
3. Boyer-Moore Algorithm for String Searching
4. Keyword Tree for Exact Pattern Matching
5. Suffix Trees and Applications
6. Rabin-Karp Algorithm for Pattern Matching
7. Shift-And Algorithm for Exact Pattern Matching
8. 09_–_8_aprile_2024_LCA.pdf
9. Advanced Algorithms: Lowest Common Ancestor and String Alignment
10. Sequence Alignment: Cost, Scoring, and Dynamic Programming
11. Dynamic Programming for Global and Local Sequence Alignment
12. Landau-Vishkin Algorithm for Approximate String Matching
13. Randomized Algorithms: QuickSort and Min-Cut
14. Randomized Min-Cut Algorithm and Conditional Probability
15. Binary Planar Partitions
16. Computational Models and Complexity Classes
17. Random Walks, SAT, and Markov Chains
18. Binary Space Partitions for Disjoint Line Segments
19. The Law of Disorder and the Drunkard’s Walk
20. Exact String Matching: The Fundamental String Problem
21. On-Line Construction of Suffix Trees