Computing the Longest Unbordered Substring

DOI10.1007/978-3-319-23826-5_24MaRDI QIDQ6487175zbMATH OpenWikidataFDO

Authors Paweł Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya

Publication date 2 October 2015

Full work available at URL https://doi.org/10.1007/978-3-319-23826-5_24

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• Longest unbordered factor in quasilinear time
• On maximal unbordered factors
• The Ehrenfeucht-Silberger problem

Cites work

• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• scientific article; zbMATH DE number 2086252 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• Linear computation of unbordered conjugate on unordered alphabet
• On maximal unbordered factors
• Periodicity and unbordered segments of words
• Relationship between the period of a finite word and the length of its unbordered segments
• The Ehrenfeucht-Silberger problem
• The longest common extension problem revisited and applications to approximate string searching
• Une caractérisation des mots périodiques

Cited in

(2)

• Longest unbordered factor in quasilinear time
• Faster algorithms for ranking/unranking bordered and unbordered words

This page was built for publication: Computing the Longest Unbordered Substring

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