Fast canonization of circular strings
From MaRDI portal
Publication:3910014
DOI10.1016/0196-6774(81)90013-4zbMath0459.68035OpenAlexW2093599904MaRDI QIDQ3910014
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(81)90013-4
Related Items
An efficient parallel algorithm for the single function coarsest partition problem ⋮ Computing the original eBWT faster, simpler, and with less memory ⋮ Sorting strings and constructing digital search trees in parallel ⋮ An automata-theoretic approach to the word problem for \(\omega\)-terms over R ⋮ Linear computation of unbordered conjugate on unordered alphabet ⋮ A note on a simple computation of the maximal suffix of a string ⋮ Finding the cyclic covers of a string ⋮ Circle graph isomorphism in almost linear time ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Fast parallel Lyndon factorization with applications ⋮ A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs ⋮ Near-optimal quantum algorithms for string problems ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ Finding the maximum suffix with fewer comparisons ⋮ A fast average case algorithm for lyndon decomposition ⋮ Optimal canonization of all substrings of a string ⋮ Optimal algorithms for computing the canonical form of a circular string ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ Efficient CRCW-PRAM algorithms for universal substring searching ⋮ Computation of Maximal Determinants of Binary Circulant Matrices ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Indexing Circular Patterns ⋮ A theory of ultimately periodic languages and automata with an application to time granularity ⋮ The alternating BWT: an algorithmic perspective ⋮ A linear time solution to the single function coarsest partition problem
