Palindromic length in linear time

Visa fullständig post



Permalänk

http://hdl.handle.net/10138/235301

Citation

Kosolobov , D , Shur , A M , Rubinchik , M & Borozdin , K 2017 , Palindromic length in linear time . in J Kärkkäinen , J Radoszewski & W Rytter (eds) , Palindromic length in linear time . , 23 , Leibniz International Proceedings in Informatics (LIPIcs) , no. 78 , Leibniz-Zentrum für Informatik , Wadern , pp. 23:1-23:12 , Annual Symposium on Combinatorial Pattern Matching , Warsaw , Poland , 04/07/2017 . https://doi.org/10.4230/LIPIcs.CPM.2017.23

Titel: Palindromic length in linear time
Författare: Kosolobov, Dmitry; Shur, Arseny M.; Rubinchik, Mikhail; Borozdin, Kirill
Editor: Kärkkäinen, Juha; Radoszewski, Jakub; Rytter, Wojciech
Medarbetare: University of Helsinki, Department of Computer Science
Utgivare: Leibniz-Zentrum für Informatik
Datum: 2017
Språk: eng
Sidantal: 12
Tillhör serie: Palindromic length in linear time
Tillhör serie: Leibniz International Proceedings in Informatics (LIPIcs)
ISBN: 978-3-95977-039-2
Permanenta länken (URI): http://hdl.handle.net/10138/235301
Abstrakt: Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to this string. The problem of finding the palindromic length drew some attention, and a few $O(n\log n)$ time online algorithms were recently designed for it. In this paper we present the first linear time online algorithm for this problem.
Subject: 113 Computer and information sciences
Licens:


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
LIPIcs_CPM_2017_23.pdf 561.1Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post