Longest unbordered factor in quasilinear time

DOI10.4230/LIPICS.ISAAC.2018.70MaRDI QIDQ5091065FDOQ5091065

Authors: Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis 

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1805.09924

Recommendations

• On maximal unbordered factors
• Computing the Longest Unbordered Substring
• Item:QQ5916287
• The Ehrenfeucht-Silberger problem
• The Ehrenfeucht-Silberger Problem

zbMATH Keywords

stringsperiodborderfactorisationlongest unbordered factor

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Constructing Efficient Dictionaries in Close to Sorting Time
• Jewels of Stringology
• Fast Pattern Matching in Strings
• Linear computation of unbordered conjugate on unordered alphabet
• Computing the longest previous factor
• Internal pattern matching queries in a text and applications
• Algorithms on Strings
• Relationship between the period of a finite word and the length of its unbordered segments
• Periodicity and unbordered segments of words
• Computing longest previous factor in linear time and applications
• The Ehrenfeucht-Silberger problem
• On maximal unbordered factors
• Computing the Longest Unbordered Substring

Cited In (5)

• Quasi-Linear-Time Algorithm for Longest Common Circular Factor
• Smallest and Largest Block Palindrome Factorizations
• Counting maximal-exponent factors in words
• Longest property-preserved common factor: a new string-processing framework
• Internal pattern matching queries in a text and applications

This page was built for publication: Longest unbordered factor in quasilinear time

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