Near-optimal computation of runs over general alphabet via non-crossing LCE queries

Maxime Crochemore*, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Fingerprint

Dive into the research topics of 'Near-optimal computation of runs over general alphabet via non-crossing LCE queries'. Together they form a unique fingerprint.

Computer Science