String indexing for top-k close consecutive occurrences

HIGHLIGHTS

• who: Philip Bille and collaborators from the Technical University of Denmark, DTU Compute, Lyngby, Denmark have published the Article: String Indexing for Top-k Close Consecutive Occurrences, in the Journal: (JOURNAL)
• what: Along the way the authors develop several techniques of independent interest including a new translation of the problem into a line segment intersection problem and a new recursive clustering technique for trees.

SUMMARY

Keyword and phrases String indexing, pattern matching, consecutive occurrences Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2020.14 Related Version https://arxiv.org/abs/2007.04128 . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.