An on-line string superprimitivity test
From MaRDI portal
Publication:1209376
DOI10.1016/0020-0190(92)90111-8zbMath0795.68079OpenAlexW2056972845MaRDI QIDQ1209376
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90111-8
Related Items
An optimal algorithm to compute all the covers of a string, On left and right seeds of a string, Computing covers using prefix tables, String covers of a tree, Finding all periods and initial palindromes of a string in parallel, Computing the \(\lambda \)-covers of a string, Two strings at Hamming distance 1 cannot be both quasiperiodic, Covering problems for partial words and for indeterminate strings, Covering a string, Efficient seed computation revisited, Enhanced string covering, Can we recover the cover?, Finding the cyclic covers of a string, String Covering: A Survey, The set of parameterized \(k\)-covers problem, The “Runs” Theorem, Subsequence covers of words, Efficient algorithms for shortest partial seeds in words, Crochemore's partitioning on weighted strings and applications, Verifying and enumerating parameterized border arrays, Experimental evaluation of algorithms for computing quasiperiods, Efficient Computation of 2-Covers of a String., Fast algorithm for partial covers in words, A work-time optimal algorithm for computing all string covers, Linear-time computation of prefix table for weighted strings {\&} applications, Efficient Seeds Computation Revisited, ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS, String covering with optimal covers, Computing regularities in strings: a survey, IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS, An extension of the periodicity lemma to longer periods, Shortest covers of all cyclic shifts of a string, Optimality of some algorithms to detect quasiperiodicities, Approximate periods of strings, Generalized approximate regularities in strings, On approximate enhanced covers under Hamming distance, Universal reconstruction of a string, Computing runs on a trie, Quasi-Periodicity in Streams, A Linear-Time Algorithm for Seeds Computation, Approximate cover of strings, Quasiperiodicity and string covering, INFERRING STRINGS FROM COVER ARRAYS, Normal forms of quasiperiodic strings, Repetitive perhaps, but certainly not boring, Testing string superprimitivity in parallel, Quasi-Periodicity Under Mismatch Errors, \(k\)-approximate quasiperiodicity under Hamming and edit distance
Cites Work
