Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Combinatorial Pattern Matching

CPM 2002: Combinatorial Pattern Matching pp 76–84Cite as

Two-Pattern Strings

  • Conference paper
  • First Online:

  • 385 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2373))

Abstract

This paper introduces a new class of strings on {a, b}, called two-pattern strings, that constitute a substantial generalization of Sturmian strings while at the same time sharing many of their nice properties. In particular, we show that, in common with Sturmian strings, only time linear in the string length is required to recognize a two-pattern string as well as to compute all of its repetitions. We also show that two-pattern strings occur in some sense frequently in the class of all strings on {a,b}.

Supported in part by grants from the Natural Sciences & Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Boshernitzan & Aviezri S. Fraenkel, A linear algorithm for nonhomogeneous spectra of numbers, J. Algorithms 5 (1984) 187–198.

    Article  MATH  MathSciNet  Google Scholar 

  2. Maxime Crochemore, An optimal algorithm for computing the repetitions in a word, IPL 12-5 (1981) 244–250.

    Article  MathSciNet  Google Scholar 

  3. Martin Farach, Optimal suffix tree construction with large alphabets, Proc. 38th Annual IEEE Symp. FOCS (1997) 137–143.

    Google Scholar 

  4. Aviezri S. Fraenkel & R. Jamie Simpson, The exact number of squares in Fibonacci words, TCS 218-1 (1999) 83–94.

    Google Scholar 

  5. František Franěk, Ayşe Karaman & W. F. Smyth, Repetitions in Sturmian strings, TCS 249-2 (2000) 289–303.

    Article  Google Scholar 

  6. Leo J. Guibas & Andrew M. Odlyzko, Periods in strings, J. Combinatorial Theory, Series A 30 (1981) 19–42.

    Article  MathSciNet  Google Scholar 

  7. Costas S. Iliopoulos, Dennis Moore & W. F. Smyth, A characterization of the squares in a Fibonacci string, TCS 172 (1997) 281–291.

    Article  MATH  MathSciNet  Google Scholar 

  8. Roman Kolpakov & Gregory Kucherov, On maximal repetitions in words, J. Discrete Algorithms 1 (2000) 159–186.

    MathSciNet  Google Scholar 

  9. Abraham Lempel & Jacob Ziv, On the complexity of finite sequences, IEEE Trans. Information Theory 22 (1976) 75–81.

    Article  MATH  MathSciNet  Google Scholar 

  10. Michael G. Main, Detecting leftmost maximal periodicities, Discrete Applied Maths. 25 (1989) 145–153.

    Article  MathSciNet  MATH  Google Scholar 

  11. Jacob Ziv & Abraham Lempel, A universal algorithm for sequential data compression, IEEE Trans. Information Theory 23 (1977) 337–343.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Algorithms Research Group, Department of Computing & Software, McMaster University, Hamilton, Ontario, Canada, L8S 4K1

    František Franěk, Jiandong Jiang, Weilin Lu & William F. Smyth

  2. Toronto Laboratories, IBM Canada, 8200 Warden Avenue, Markham, Ontario, Canada, L6G 1C7

    Jiandong Jiang & Weilin Lu

  3. School of Computing, Curtin University, GPO Box U-1987, Perth, WA, 6845, Australia

    William F. Smyth

Authors
  1. František Franěk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiandong Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weilin Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. William F. Smyth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrial Engineering and Computer Science, University of Padova, Via Gradenigo 6/A, 35131, Padova, Italy

    Alberto Apostolico

  2. Department of Informatics, Kyushu University, Fukuoka 812-8581, Japan

    Masayuki Takeda

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Franěk, F., Jiang, J., Lu, W., Smyth, W.F. (2002). Two-Pattern Strings. In: Apostolico, A., Takeda, M. (eds) Combinatorial Pattern Matching. CPM 2002. Lecture Notes in Computer Science, vol 2373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45452-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45452-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43862-5

  • Online ISBN: 978-3-540-45452-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation