A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A note on the longest common Abelian factor problem
[article]
2015
arXiv
pre-print
Abelian string matching problems are becoming an object of considerable interest in last years. Very recently, Alatabbi et al. AILR2015 presented the first solution for the longest common Abelian factor problem for a pair of strings, reaching O(σ n^2) time with O(σ n n) bits of space, where n is the length of the strings and σ is the alphabet size. In this note we show how the time complexity can be preserved while the space is reduced by a factor of σ, and then how the time complexity can be
arXiv:1503.01093v3
fatcat:54kkhmaehnbvxaq6oajlbw72ci