Skip to Main content Skip to Navigation
Conference papers

Longest common factor of two words

Abstract : The LCF of two words u and v is the maximal length of a common factor of u and v. A linear time algorithm to compute LCF is given, based on a linear time algorithm to build the minimal suffix automaton of a word. The algorithm naturally turns into a real-time string-matching algorithm.
Document type :
Conference papers
Complete list of metadata
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Thursday, September 8, 2011 - 4:24:30 PM
Last modification on : Saturday, January 15, 2022 - 3:58:23 AM

Links full text




Maxime Crochemore. Longest common factor of two words. TAPSOFT'87 (Pisa, 1987), 1987, Pise, Italy. pp.26-36, ⟨10.1007/3-540-17660-8_45⟩. ⟨hal-00620786⟩



Record views