Weighted Ancestors in Suffix Trees
From MaRDI portal
Publication:2921431
DOI10.1007/978-3-662-44777-2_38zbMath1425.68087arXiv1406.7716OpenAlexW1602808498MaRDI QIDQ2921431
Patrick K. Nicholson, Paweł Gawrychowski, Moshe Lewenstein
Publication date: 8 October 2014
Published in: Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.7716
Related Items (14)
The property suffix tree with dynamic properties ⋮ Algorithms for anti-powers in strings ⋮ Ranked Document Retrieval with Forbidden Pattern ⋮ On the average-case complexity of pattern matching with wildcards ⋮ Longest Common Prefix with Mismatches ⋮ Unnamed Item ⋮ \(k\)-abelian pattern matching ⋮ Detecting One-Variable Patterns ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Ranked document retrieval for multiple patterns ⋮ A linear-space data structure for range-LCP queries in poly-logarithmic time ⋮ Indexing weighted sequences: neat and efficient ⋮ Computing the Antiperiod(s) of a String ⋮ LZ-End Parsing in Linear Time
This page was built for publication: Weighted Ancestors in Suffix Trees
