Efficient Data Structures for Range Shortest Unique Substring Queries
Let <inline-formula><math display="inline"><semantics><mrow><mi mathvariant="sans-serif">T</mi><mo>[</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>]</mo></mrow></semantics></mat...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/11/276 |