A note on efficient computation of all Abelian periods in a string

@article{Crochemore2013ANO,
  title={A note on efficient computation of all Abelian periods in a string},
  author={Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Marcin Kubica and Jakub W. Pachocki and Jakub Radoszewski and Wojciech Rytter and Wojciech Tyczynski and Tomasz Walen},
  journal={ArXiv},
  year={2013},
  volume={abs/1208.3313}
}
  • Maxime Crochemore, Costas S. Iliopoulos, +6 authors Tomasz Walen
  • Published in Inf. Process. Lett. 2013
  • Mathematics, Computer Science
  • We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in 1997. By the way we show an alternative algorithm for Abelian squares. We also obtain a linear time algorithm finding all ''long'' Abelian periods. The aim of the paper is a (new) reduction of the problem of all Abelian periods to that of (already solved) all Abelian squares which provides new insight into both… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    5
    Twitter Mentions

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 11 CITATIONS

    String Periods in the Order-Preserving Model

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    Computing Abelian regularities on RLE strings

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    On the Parikh-de-Bruijn grid

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Computing Abelian Covers and Abelian Runs

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES

    Weak repetitions in strings

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Computing Abelian Periods in Words

    VIEW 1 EXCERPT

    Developments in Language Theory

    VIEW 1 EXCERPT

    Indexing permutations for binary strings

    VIEW 1 EXCERPT

    A cyclic binary morphism avoiding Abelian fourth powers

    VIEW 1 EXCERPT

    Long binary patterns are Abelian 2-avoidable

    VIEW 1 EXCERPT