 |
HAL UPEC - UPEM Portal |  |
 |
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.
https://hal-upec-upem.archives-ouvertes.fr/hal-00620786
Contributor : Maxime Crochemore <>
Submitted on : Thursday, September 8, 2011 - 4:24:30 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Contributor : Maxime Crochemore <>
Submitted on : Thursday, September 8, 2011 - 4:24:30 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Links full text
