Algorithms for Longest Common Abelian Factors

DOI10.1142/S0129054116500143zbMath1353.68219arXiv1503.00049OpenAlexW2963775312MaRDI QIDQ2833540

M. Sohel Rahman, Costas S. Iliopoulos, Ali Alatabbi, Alessio Langiu

Publication date: 18 November 2016

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

Full work available at URL: https://arxiv.org/abs/1503.00049

zbMATH Keywords

algorithmlinearParikh vectorlongest common factorabelian propertiesabelian match

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Indexing permutations for binary strings
• Sub-quadratic time and linear space data structures for permutation matching in binary strings
• On Context-Free Languages

This page was built for publication: Algorithms for Longest Common Abelian Factors