Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree
Channel: Dominik Koeppl
Date: 2021-09-26

Presentation of the paper "Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree" at the 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021).

☆ paper: -
☆ preprint: https://dkppl.de/redir.php?t=paper&f=spire21savl.m.pdf 
☆ slides: https://dkppl.de/redir.php?t=paper&f=spire21savl.s.pdf
☆ mirror of this video: https://dkppl.de/redir.php?t=paper&f=spire21savl.mp4

Erratum:
☆ on slide 9, 11:43, for rule l:  the cla_v of v is not *preceding* but the *succeeding* suffix. 

You can find other material related to my research at my homepage https://dkppl.de/.

As always, questions and comments are welcome!