scientific article
From MaRDI portal
Publication:3690246
zbMath0572.68068MaRDI QIDQ3690246
Michael G. Main, Richard J. Lorentz
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On two-dimensional pattern matching by optimal parallel algorithms, Finding the leftmost critical factorization on unordered alphabet, A fast algorithm for finding the positions of all squares in a run-length encoded string, Detecting morphic images of a word: On the rank of a pattern, An efficient algorithm for online square detection, Online Detection of Repetitions with Backtracking, The lexicographically least square-free word with a given prefix, Computing runs on a general alphabet, Efficient string matching on packed texts, Un réseau linéaire pour la reconnaissance des mots sans carré, An efficient algorithm to test square-freeness of strings compressed by straight-line programs, Detecting the morphic images of a word : improving the general algorithm, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, New simple efficient algorithms computing powers and runs in strings, Optimal parallel detection of squares in strings, Efficient on-line repetition detection, Efficient detection of quasiperiodicities in strings, Linear time algorithms for finding and representing all the tandem repeats in a string, Optimal bounds for computing \({\alpha}\)-gapped repeats, Simple and flexible detection of contiguous repeats using a suffix tree, Optimal parallel algorithms for periods, palindromes and squares, Transducers and repetitions, Detecting leftmost maximal periodicities, Approximate periodicity
