On the Longest Common Factor Problem

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.

[1]  Roberto Grossi,et al.  Suffix trees and their applications in string algorithms , 1993 .

[2]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[3]  Lucas Chi Kwong Hui,et al.  Color Set Size Problem with Application to String Matching , 1992, CPM.

[4]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[5]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[6]  Alberto Apostolico,et al.  The Myriad Virtues of Subword Trees , 1985 .

[7]  Giancarlo Mauri,et al.  On-line construction of compact directed acyclic word graphs , 2005, Discret. Appl. Math..

[8]  Chiara Epifanio,et al.  On the Suffix Automaton with Mismatches , 2007, CIAA.

[9]  Maxime Crochemore,et al.  Algorithmique du texte , 2001 .

[10]  Maxime Crochemore.  Reducing space for index implementation , 2003, Theor. Comput. Sci..

[11]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[12]  Volker Heun,et al.  Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE , 2006, CPM.

[13]  Moritz G. Maaß.  Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem , 2006 .

[14]  Enno Ohlebusch,et al.  Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.

[15]  Moritz G. Maaß.  Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem , 2006, Softw. Pract. Exp..

[16]  Raffaele Giancarlo,et al.  The Myriad Virtues of Suffix Trees , 2006 .