scientific article
From MaRDI portal
Publication:3128913
zbMath0871.68132MaRDI QIDQ3128913
No author found.
Publication date: 5 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Algorithms For Computing Approximate Repetitions In Musical Sequences, An optimal algorithm to compute all the covers of a string, Two strings at Hamming distance 1 cannot be both quasiperiodic, Covering problems for partial words and for indeterminate strings, Efficient seed computation revisited, Finding the cyclic covers of a string, Efficient Computation of 2-Covers of a String., A work-time optimal algorithm for computing all string covers, A Linear-Time Algorithm for Seeds Computation
