Linear Nondeterministic Dawg String Matching Algorithm (Abstract) | SpringerLink
Skip to main content
Springer Nature Link
Log in

Linear Nondeterministic Dawg String Matching Algorithm (Abstract)

  • Conference paper
String Processing and Information Retrieval (SPIRE 2004)

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

Included in the following conference series:

Abstract

The exact string matching problem is to find all the occurrences of a given pattern x=x 1 x 2 ··· x m in a large text y=y 1 y 2 ··· y n , where both x and y are sequences of symbols drawn from a finite character set Σ of size σ.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Similar content being viewed by others

References

  1. Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bitparallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA) 5 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center of Computer Network and Information Security Technology, Harbin Institute of Technology, Harbin, 150001, P.R. China

    Longtao He & Binxing Fang

Authors
  1. Longtao He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Binxing Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  2. Department of Information Engineering, University of Padova,  

    Massimo Melucci

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, L., Fang, B. (2004). Linear Nondeterministic Dawg String Matching Algorithm (Abstract). In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30213-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23210-0

  • Online ISBN: 978-3-540-30213-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation