String periods in the order-preserving model › Research Explorer

String periods in the order-preserving model

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

DOI

https://doi.org/10.4230/LIPIcs.STACS.2018.38
Final published version

Garance Gourdel
Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter
Arseny Shur
Tomasz Walen

Original language	English
Title of host publication	35th Symposium on Theoretical Aspects of Computer Science, STACS 2018
Editors	R Niedermeier, B Vallee
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages	16
Volume	96
ISBN (Electronic)	9783959770620
DOIs	https://doi.org/10.4230/LIPIcs.STACS.2018.38
Publication status	Published - 2 Feb 2018
Event	35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 - Caen, France Duration: 28 Feb 2018 → 3 Mar 2018

Publication series

Name	Leibniz International Proceedings in Informatics
Publisher	SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS
Volume	96
ISSN (Print)	1868-8969

Conference

Conference	35th Symposium on Theoretical Aspects of Computer Science, STACS 2018
Country/Territory	France
City	Caen
Period	28/02/2018 → 03/03/2018

WoS ResearchAreas Categories

Computer Science, Information Systems
Mathematics, Applied
Computer Science, Theory & Methods

ASJC Scopus subject areas

Software

Research areas

Effcient Algorithm, Order-preserving Pattern Matching, Period, PARTIAL WORDS, ABELIAN PERIODS, EFFICIENT COMPUTATION, Efficient Algorithm, FINE, ALGORITHMS, WILFS THEOREM

ID: 7033795