The subtree max gap problem with application to parallel string covering
From MaRDI portal
Publication:2508342
DOI10.1006/inco.1995.1162zbMath1096.68775OpenAlexW2132770565MaRDI QIDQ2508342
Costas S. Iliopoulos, Omer Berkman, Kun Soo Park
Publication date: 10 October 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1162
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (10)
Algorithms For Computing Approximate Repetitions In Musical Sequences ⋮ On left and right seeds of a string ⋮ Efficient seed computation revisited ⋮ Computing maximal-exponent factors in an overlap-free word ⋮ String Covering: A Survey ⋮ Efficient Seeds Computation Revisited ⋮ Approximate periods of strings ⋮ Generalized approximate regularities in strings ⋮ A Linear-Time Algorithm for Seeds Computation ⋮ Repetitive perhaps, but certainly not boring
This page was built for publication: The subtree max gap problem with application to parallel string covering
