On Maximal Unbordered Factors

DOI10.1007/978-3-319-19929-0_29zbMath1397.68150arXiv1504.07406OpenAlexW2146315056WikidataQ58064460 ScholiaQ58064460MaRDI QIDQ2942272

Alexander Loptev, Gregory Kucherov, Tatiana Starikovskaya

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

Unnamed Item ⋮ Maximal unbordered factors of random strings

Cites Work

• Unnamed Item
• Unnamed Item
• Linear computation of unbordered conjugate on unordered alphabet
• The longest common extension problem revisited and applications to approximate string searching
• The Ehrenfeucht-Silberger problem
• Periodicity and unbordered segments of words
• Relationship between the period of a finite word and the length of its unbordered segments
• Une caractérisation des mots périodiques
• Counting distinct strings
• Validating the Knuth-Morris-Pratt failure function, fast and online
• A note on bifix-free sequences (Corresp.)
• Internal Pattern Matching Queries in a Text and Applications
• On the Number of Prefix and Border Tables

This page was built for publication: On Maximal Unbordered Factors