Lexicographically least circular substrings
From MaRDI portal
Publication:1144948
DOI10.1016/0020-0190(80)90149-0zbMath0444.68064OpenAlexW1995300673MaRDI QIDQ1144948
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(80)90149-0
Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to computer science (68-04)
Related Items
An efficient parallel algorithm for the single function coarsest partition problem, Average cost of Duval's algorithm for generating Lyndon words, A universal cycle for strings with fixed-content (which are also known as multiset permutations), Inside the binary reflected gray code: flip-swap languages in 2-gray code order, Canonical representations of partial 2-and 3-trees, On the language of primitive words, Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence, Sorting strings and constructing digital search trees in parallel, Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences, An automata-theoretic approach to the word problem for \(\omega\)-terms over R, On a Combinatorial Generation Problem of Knuth, Necklaces and Lyndon words in colexicographic and binary reflected Gray code order, Linear computation of unbordered conjugate on unordered alphabet, Flip-swap languages in binary reflected Gray code order, Finding the cyclic covers of a string, Constructing the first (and coolest) fixed-content universal cycle, Circle graph isomorphism in almost linear time, Quantum algorithm for lexicographically minimal string rotation, A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs, Near-optimal quantum algorithms for string problems, Two-way machines and de Bruijn words, A fast average case algorithm for lyndon decomposition, Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns, Optimal canonization of all substrings of a string, A surprisingly simple de Bruijn sequence construction, Optimal algorithms for computing the canonical form of a circular string, Canonical representations of partial 2- and 3-trees, Fast detection and display of symmetry in outerplanar graphs, Description and analysis of a bottom-up DFA minimization algorithm, Computation of Maximal Determinants of Binary Circulant Matrices, Ranking and unranking fixed-density necklaces and Lyndon words, A framework for constructing de Bruijn sequences via simple successor rules, An efficient generalized shift-rule for the prefer-max de Bruijn sequence, A simple shift rule for \(k\)-ary de Bruijn sequences, Indexing Circular Patterns, A theory of ultimately periodic languages and automata with an application to time granularity, The alternating BWT: an algorithmic perspective, A constant-time algorithm for middle levels Gray codes, Unnamed Item, Efficient universal cycle constructions for weak orders, Linear time algorithm for the conjugacy problem in the first Grigorchuk group, A linear time solution to the single function coarsest partition problem
Cites Work
