Abstract
Given a word w and a Parikh vector P, an abelian run of period P in w is a maximal occurrence of a substring of w having abelian period P. We give an algorithm that finds all the abelian runs of period P in a word of length n in time O(n × |P|) and space O(σ + |P|).
Author supplied keywords
Cite
CITATION STYLE
APA
Fici, G., Lecroq, T., Lefebvre, A., & Prieur-Gaston, É. (2015). Online computation of abelian runs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 391–401). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free