Longest Repeats with a Block of Don’t Cares

  • Maxime Crochemore
  • Costas S. Iliopoulos
  • Manal Mohamed
  • Marie-France Sagot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)


We introduce an algorithm for extracting all longest repeats with k don’t cares from a given sequence. Such repeats are composed of two parts separated by a block of k don’t care symbols. The algorithm uses suffix trees to fulfill this task and relies on the ability to answer the lowest common ancestor queries in constant time. It requires O(n log n) time in the worst-case.


Combinatorial Problems String Repeat Extraction Don’t Care Suffix Tree Lowest Common Ancestor Efficient Merging 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adel’son-Vel’skii, G.M., Landis, Y.M.: An Algorithm for the Organisation of Information. Doklady Akademii Nauk SSSR 146, 263–266 (1962)MathSciNetGoogle Scholar
  2. 2.
    Brodal, G.S., Lyngsø, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gaps. Journal of Discrete Algorithms. Special Issue of Matching Patterns 1(1), 77–104 (2000)Google Scholar
  3. 3.
    Brown, M.R., Tarjan, R.E.: A Fast Merging Algorithm. Journal of the ACM 26(2), 211–226 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)CrossRefGoogle Scholar
  5. 5.
    Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge Univesity Press, Cambridge (1997)zbMATHCrossRefGoogle Scholar
  6. 6.
    Iliopoulos, C.S., Markis, C., Sioutas, S., Tsakalidis, A., Tsichlas, K.: Identififying Ocuurences of Maximal Pairs in Multiple Strings. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 133–143. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Kolpakov, R., Kucherov, G.: Finding Repeats with Fixed Gap. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 162–168. Springer, Heidelberg (2002)Google Scholar
  8. 8.
    Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplifications and Parallization. SIAM Journal of Computation 17, 1253–1262 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Stoye, J.: Affix Trees. Diploma Thesis, Universität Bielefeld, Forschungsbericht der Technischen Fakultät, Abteilung Informationstechnik, Report 2000–04 (2000), ISSN 0946-7831Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Maxime Crochemore
    • 1
    • 2
  • Costas S. Iliopoulos
    • 2
  • Manal Mohamed
    • 2
  • Marie-France Sagot
    • 3
  1. 1.Institut Gaspard-MongeUniversity of Marne-la-ValléeMarne-la-Vallée CEDEX 2France
  2. 2.Department of Computer ScienceKing’s College LondonLondonEngland
  3. 3.Inria Rhône-Alpes, Laboratoire de Biométrie et Biologie ÉvolutiveUniversité Claude BernardVilleurbanne cedexFrance

Personalised recommendations