A fast average case algorithm for lyndon decomposition

DOI10.1080/00207169508804408zbMath0847.68049OpenAlexW2100671534MaRDI QIDQ4876360

Costas S. Iliopoulos, W. F. Smyth

Publication date: 7 October 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://researchrepository.murdoch.edu.au/id/eprint/27526/

zbMATH Keywords

Lyndon decompositioncanonization algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items (1)

Quantum algorithm for lexicographically minimal string rotation

Cites Work

• Unnamed Item
• Lexicographically least circular substrings
• An improved algorithm to check for polygon similarity
• Factorizing words over an ordered alphabet
• Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
• Fast canonization of circular strings
• Fast Pattern Matching in Strings

This page was built for publication: A fast average case algorithm for lyndon decomposition