A fast algorithm for permutation pattern matching based on alternating runs

DOI10.1007/978-3-642-31155-0_23MaRDI QIDQ6826267zbMATH OpenFDO

Authors Marie-Louise Bruner, Martin Lackner

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31155-0_23

Mathematics Subject Classification ID

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

This page was built for publication: A fast algorithm for permutation pattern matching based on alternating runs

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