Linear time algorithm for the longest common repeat problem

Lee, Inbok; Iliopoulos, Costas S.; Park, Kunsoo

by Inbok Lee, Costas S. Iliopoulos, Kunsoo Park

Reference:

Linear time algorithm for the longest common repeat problem (Inbok Lee, Costas S. Iliopoulos, Kunsoo Park), In Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04) (Alberto Apostolico, Massimo Melucci, eds.), Springer-Verlag Heidelberg, volume 3246, 2004.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@INPROCEEDINGS{LIP04LongestCommonRepeat,
  AUTHOR =       "Inbok Lee and Costas S. Iliopoulos and Kunsoo Park",
  TITLE =        "Linear time algorithm for the longest common repeat problem",
  BOOKTITLE =    "Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04)",
  YEAR =         "2004",
  editor =       "Alberto Apostolico and Massimo Melucci",
  volume =       "3246",
  number =       "",
  series =       LNCS,
  pages =        "10--17",
  address =      "Padova, Italy",
  month =        "October",
  organization = "",
  publisher =    "Springer-Verlag Heidelberg"

}