Skip to main content
Springer Nature Link
Log in

DAWG versus Suffix Array

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2002)

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

Included in the following conference series:

  • 492 Accesses

Abstract

This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array and the second is the Directed Acyclic Word Graph (DAWG). We present an eficient DAWG implementation. This implementation is compared with other structures used for text indexing. The construction time and speed of searching of a set of substrings are shown for the DAWG and the Suffix Array.

This research has been partially supported by the Ministry of Education, Youth, and Sports of Czech Republic under research program No J04/98:212300014 and by the Grant Agency of Czech Republic under research program No 102/01/1433.

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
$34.99 /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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Anderson A, Nilson S. Efficient implementation of suffix trees. Software-Practice and Experience, 25(1995); 129–141.

    Article  Google Scholar 

  2. Balík M. String Matching in a Text. Diploma Thesis, CTU, Dept. of Computer Science amp; Engineering, Prague, 1998.

    Google Scholar 

  3. Crochemore M, Rytter W. Text Algorithms. Oxford University Press, New York, 1994.

    MATH  Google Scholar 

  4. Crochemore M, Vérin R. Direct Construction Of Compact Directed Acyclic Word Graphs. CPM97, A. Apostolico and J. Hein, eds., LNCS 1264, Springer-Verlag, 1997; 116–129.

    Google Scholar 

  5. Gonnet G.H, Baeza-Yates R. Handbook of Algorithms and Data Structures-In Pascal and C. Addison-Wesley, Wokingham, UK, 1991.

    Google Scholar 

  6. Holub J., Melichar B.: Approximate String Matching using Factor Automata. Theoretical Computer Science, Vol. 249 (2), Elsevier Science, 2000, pp. 305–311.

    Article  MATH  MathSciNet  Google Scholar 

  7. Huffman, D.A. A method for construction of minimum redundancy codes. Proceedings of IRE, Vol.40, No.9, Sept.1952; 1098–1101.

    Google Scholar 

  8. Irving R.W. Suffix binary search trees. Technical report TR-1995-7, Computing science Department, University of Glasgow, Apr.95.

    Google Scholar 

  9. Kärkkäinen J. Suffix cactus: A cross between suffix tree and suffix array. in Proc. 6th Symposium on combinatorial Pattern Matching, CPM95, 1995; 191–204.

    Google Scholar 

  10. Kurtz S. Reducing the Space Requirement of Suffix Trees. Software-Practice and Experience, 29(13), 1999; 1149–1171.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Czech Technical University, Karlovo nám. 13, 121 35, Prague 2, CZ, Czech Republic

    Miroslav Balík

Authors
  1. Miroslav Balík
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. UFR des Sciences et Techniques, Université de Rouen, LIFAR, 76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud

  2. Departement Informatique, Laboratoire d’Informatique de l’Université de Tours École Polytechnique de l’Université de Tours, 64 avenue Jean-Portalis, 37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balík, M. (2003). DAWG versus Suffix Array. In: Champarnaud, JM., Maurel, D. (eds) Implementation and Application of Automata. CIAA 2002. Lecture Notes in Computer Science, vol 2608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44977-9_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44977-9_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40391-3

  • Online ISBN: 978-3-540-44977-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation