Subquadratic-Time Algorithms for Abelian Stringology Problems

DOI10.1007/978-3-319-32859-1_27zbMath1460.68136OpenAlexW2416295332MaRDI QIDQ2807851

Tomasz Kociumaka, Bartłomiej Wiśniewski, Jakub Radoszewski

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_27

zbMATH Keywords

abelian periodjumbled pattern matchingabelian squarejumbled indexing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (4)

Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ String covers of a tree ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ String Periods in the Order-Preserving Model

This page was built for publication: Subquadratic-Time Algorithms for Abelian Stringology Problems