### Abstract

Strings u, v are said to be Abelian equivalent if u is a permutation of the characters appearing in v. A string w is said to have a full Abelian period p if w = w_{1} …w_{k}, where all wi’s are of length p each and are all Abelian equivalent. This paper studies reverse-engineering problems on full Abelian periods. Given a positive integer n and a set D of divisors of n, we show how to compute in O(n) time the lexicographically smallest string of length n which has all elements of D as its full Abelian periods and has the minimum number of full Abelian periods not in D. Moreover, we give an algorithm to enumerate all such strings in amortized constant time per output after O(n)-time preprocessing. Also, we show how to enumerate the strings which have all elements of D as its full Abelian periods in amortized constant time per output after O(n)-time preprocessing.

Original language | English |
---|---|

Title of host publication | Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings |

Editors | Khaled Elbassioni, Kazuhisa Makino |

Publisher | Springer Verlag |

Pages | 768-779 |

Number of pages | 12 |

ISBN (Print) | 9783662489703 |

DOIs | |

Publication status | Published - Jan 1 2015 |

Event | 26th International Symposium on Algorithms and Computation, ISAAC 2015 - Nagoya, Japan Duration: Dec 9 2015 → Dec 11 2015 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 9472 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 26th International Symposium on Algorithms and Computation, ISAAC 2015 |
---|---|

Country | Japan |

City | Nagoya |

Period | 12/9/15 → 12/11/15 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Inferring strings from full abelian periods'. Together they form a unique fingerprint.

## Cite this

*Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings*(pp. 768-779). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9472). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_64