Skip to main content
Top
Published in: Natural Computing 1/2009

01-03-2009

Light-based string matching

Author: Mihai Oltean

Published in: Natural Computing | Issue 1/2009

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

String matching is a very important problem in computer science. The problem consists in finding all the occurrences of a pattern P of length m in a text T of length n. We describe a special device which can do string matching by performing nm + 1 text-to-pattern comparisons. The proposed device uses light and optical filters for performing computations. Two physical implementations are proposed. One of them uses colored glass and the other one uses polarizing filters. The strengths and the weaknesses of each method are deeply discussed.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Born M, Wolf E (1999) Principles of optics, 7th edn. Cambridge University Press, Cambridge Born M, Wolf E (1999) Principles of optics, 7th edn. Cambridge University Press, Cambridge
go back to reference Boyer R, Moore S (1977) A fast string matching algorithm. Comm Assoc Comput Mach 20:762–772 Boyer R, Moore S (1977) A fast string matching algorithm. Comm Assoc Comput Mach 20:762–772
go back to reference Cole R, Hariharan R, Paterson M, Zwick U (1995) Tighter lower bounds on the exact complexity of string matching. SIAM J Comput 24(1):30–45MATHCrossRefMathSciNet Cole R, Hariharan R, Paterson M, Zwick U (1995) Tighter lower bounds on the exact complexity of string matching. SIAM J Comput 24(1):30–45MATHCrossRefMathSciNet
go back to reference Cormen TH, Leiserson CE, Rivest RR (1990) Introduction to algorithms. MIT Press, Cambridge, MA Cormen TH, Leiserson CE, Rivest RR (1990) Introduction to algorithms. MIT Press, Cambridge, MA
go back to reference Crochemore M, Czumaj A, Gasiniec L, Jarominek S, Lecroq T, Plandowski W, Rytter W (1994) Speeding up two string-matching algorithms. Algorithmica 5:247–267CrossRef Crochemore M, Czumaj A, Gasiniec L, Jarominek S, Lecroq T, Plandowski W, Rytter W (1994) Speeding up two string-matching algorithms. Algorithmica 5:247–267CrossRef
go back to reference Damask JN (2004) Polarization optics in telecommunications. Springer Verlag, New York Damask JN (2004) Polarization optics in telecommunications. Springer Verlag, New York
go back to reference Feitelson DG (1988) Optical computing: a survey for computer scientists. MIT Press, Cambridge, MA Feitelson DG (1988) Optical computing: a survey for computer scientists. MIT Press, Cambridge, MA
go back to reference Galil Z, Giancarlo R (1993) On the exact complexity of string matching: upper bounds. SIAM J Comput 3:407–437MathSciNet Galil Z, Giancarlo R (1993) On the exact complexity of string matching: upper bounds. SIAM J Comput 3:407–437MathSciNet
go back to reference Goodman JW (1982) Architectural development of optical data processing systems. Aust J Electr Electron Eng 2:139–149 Goodman JW (1982) Architectural development of optical data processing systems. Aust J Electr Electron Eng 2:139–149
go back to reference Guibas LJ, Odlyzko AM (1980) A new proof of the linearity of the Boyer–Moore string searching algorithm. SIAM J Comput 9:672–682MATHCrossRefMathSciNet Guibas LJ, Odlyzko AM (1980) A new proof of the linearity of the Boyer–Moore string searching algorithm. SIAM J Comput 9:672–682MATHCrossRefMathSciNet
go back to reference Hecht E (2002) Optics, 4th edn. Addison Wesley, Reading, MA Hecht E (2002) Optics, 4th edn. Addison Wesley, Reading, MA
go back to reference MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: LeCam LM, Neyman J (eds) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, pp 281–297 MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: LeCam LM, Neyman J (eds) Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, pp 281–297
go back to reference Murphy N, Naughton TJ, Woods D, Henley B, McDermott K, Duffy E, van der Burgt PJM, Woods N (2006) Implementations of a model of physical sorting. In: Adamatzky A, Teuscher C (eds) From utopian to genuine unconventional computers workshop. Luniver Press, pp 79–100 Murphy N, Naughton TJ, Woods D, Henley B, McDermott K, Duffy E, van der Burgt PJM, Woods N (2006) Implementations of a model of physical sorting. In: Adamatzky A, Teuscher C (eds) From utopian to genuine unconventional computers workshop. Luniver Press, pp 79–100
go back to reference Naughton TJ (2000) A model of computation for Fourier optical processors. In: Lessard RA, Galstian T (eds) Optics in computing, Proc SPIE, vol 4089, pp 24–34 Naughton TJ (2000) A model of computation for Fourier optical processors. In: Lessard RA, Galstian T (eds) Optics in computing, Proc SPIE, vol 4089, pp 24–34
go back to reference Oltean M (2006) A light-based device for solving the Hamiltonian path problem, unconventional computing. In: Calude C et al (eds) LNCS 4135, Springer-Verlag, Berlin, pp 217–227 Oltean M (2006) A light-based device for solving the Hamiltonian path problem, unconventional computing. In: Calude C et al (eds) LNCS 4135, Springer-Verlag, Berlin, pp 217–227
go back to reference Paniccia M, Koehl S (2005) The silicon solution, IEEE Spectrum. IEEE Press Paniccia M, Koehl S (2005) The silicon solution, IEEE Spectrum. IEEE Press
go back to reference Reif JH, Tyagi A (1997) Efficient parallel algorithms for optical computing with the discrete Fourier transform primitive. Appl Optics 36(29):7327–7340CrossRef Reif JH, Tyagi A (1997) Efficient parallel algorithms for optical computing with the discrete Fourier transform primitive. Appl Optics 36(29):7327–7340CrossRef
go back to reference Rong H, Jones R, Liu A, Cohen O, Hak D, Fang A, Paniccia M (2005a) A continuous-wave Raman silicon laser. Nature. 433:725–728CrossRef Rong H, Jones R, Liu A, Cohen O, Hak D, Fang A, Paniccia M (2005a) A continuous-wave Raman silicon laser. Nature. 433:725–728CrossRef
go back to reference Rong H, Liu A, Jones R, Cohen O, Hak D, Nicolaescu R, Fang A, Paniccia M (2005b) An all-silicon Raman laser. Nature. 433:292–294CrossRef Rong H, Liu A, Jones R, Cohen O, Hak D, Nicolaescu R, Fang A, Paniccia M (2005b) An all-silicon Raman laser. Nature. 433:292–294CrossRef
go back to reference Serway RA, Jewett JW (2004) Physics for scientists and engineers, 6th edn. Brooks/Cole, Belmont, CA Serway RA, Jewett JW (2004) Physics for scientists and engineers, 6th edn. Brooks/Cole, Belmont, CA
Metadata
Title
Light-based string matching
Author
Mihai Oltean
Publication date
01-03-2009
Publisher
Springer Netherlands
Published in
Natural Computing / Issue 1/2009
Print ISSN: 1567-7818
Electronic ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-007-9033-0

Other articles of this Issue 1/2009

Natural Computing 1/2009 Go to the issue

Premium Partner