Subquadratic-time algorithms for abelian stringology problems

DOI10.1007/978-3-319-32859-1_27MaRDI QIDQ2807851zbMATH OpenOpenAlexFDO

Authors 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 periodabelian squarejumbled indexingjumbled pattern matching

Mathematics Subject Classification ID

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

Recommendations

• Identifying all abelian periods of a string in quadratic time and relevant problems
• A note on efficient computation of all abelian periods in a string
• Longest common abelian factors and large alphabets
• Fast computation of abelian runs
• Algorithms for jumbled pattern matching in strings

Cited in

(11)

• Longest common abelian factors and large alphabets
• A note on efficient computation of all abelian periods in a string
• String covers of a tree
• Algorithms for longest common abelian factors
• Maximum number of distinct and nonequivalent nonstandard squares in a word
• String Periods in the Order-Preserving Model
• Fast algorithms for abelian periods in words and greatest common divisor queries
• Identifying all abelian periods of a string in quadratic time and relevant problems
• Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
• scientific article; zbMATH DE number 7740932 (Why is no real title available?)
• On approximate jumbled pattern matching in strings

This page was built for publication: Subquadratic-time algorithms for abelian stringology problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807851)