Combinatorics of Unique Maximal Factorization Families (UMFFs)
From MaRDI portal
Publication:3400579
DOI10.3233/FI-2009-202zbMath1211.68297MaRDI QIDQ3400579
W. F. Smyth, David E. Daykin, Jacqueline W. Daykin
Publication date: 5 February 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2009-202
lexicographic order; total order; Lyndon words; concatenation; circ-UMFF; dictionary; maximal factorization
68R15: Combinatorics on words
Related Items
Generic Algorithms for Factoring Strings, \(V\)-order: new combinatorial properties \& a simple comparison algorithm, A linear partitioning algorithm for hybrid Lyndons using \(V\)-order, Reconstructing a string from its Lyndon arrays, Enhanced string factoring from alphabet orderings, Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order, A bijective variant of the Burrows-Wheeler transform using \(V\)-order, String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time