On the longest common factor problem

Maxime Crochemore (1) , Alessandra Gabriele (2) , Filippo Mignosi (3) , Mauriana Pesaresi (4)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 Dipartimento di Matematica e Applicazioni [Palermo]
3 DI - Dipartimento di Informatica [Italy]
4 DI - Dipartimento di Informatica [Pisa]

The Longest Common Factor (LCF) of a set of strings is a well studied problem having a wide range of applications in Bioinformatics: from microarrays to DNA sequences analysis. This problem has been solved by Hui (2000) who uses a famous constant-time solution to the Lowest Common Ancestor (LCA) problem in trees coupled with use of suffix trees. A data structure for the LCA problem, although linear in space and construction time, introduces a multiplicative constant in both space and time that reduces the range of applications in many biological applications. In this article we present a new method for solving the LCF problem using the suffix tree structure with an auxiliary array that take space O(n). Our algorithm works in time O(n log a), where n is the total input size and a is the size of the alphabet. We also consider a different version of our algorithm that applies to DAWGs. In this case, we prove that the algorithm works in both time and space proportional to data DAWG's size.

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi. On the longest common factor problem. 5th IFIP International Conference on Theoretical Computer Science (TCS'08), Sep 2008, United States. pp.143-155. ⟨hal-00620280⟩