An $O(n\log n)$ algorithm for computing all maximal quasiperiodicities in strings

Iliopoulos, Costas S.; Mouchard, Laurent

by Costas S. Iliopoulos, Laurent Mouchard

Abstract:

Reference:

An $O(n\log n)$ algorithm for computing all maximal quasiperiodicities in strings (Costas S. Iliopoulos, Laurent Mouchard), In Proceedings of Computing: Australasian Theory Symposium (CATS'99) (, ed.), Springer Verlag, volume 21, 1999. ()

Bibtex Entry:

@INPROCEEDINGS{IM99MaxQuasiperiodicities,
  AUTHOR =       "Costas S. Iliopoulos and Laurent Mouchard",
  TITLE =        "An {$O(n\log n)$} algorithm for computing all maximal quasiperiodicities in strings",
  BOOKTITLE =    "Proceedings of Computing: Australasian Theory Symposium (CATS'99)",
  YEAR =         "1999",
  editor =       "",
  volume =       "21",
  number =       "3",
  series =       "Lecture Notes in Computer Science",
  pages =        "262--272",
  address =      "Auckland, New Zealand",
  month =        "",
  organization = "",
  publisher =    "Springer Verlag",
  note =         "",
  abstract =     "",
  keywords =     ""
}