Skip to main content
SpringerLink
Log in

On-Line Construction of Compact Directed Acyclic Word Graphs*

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2001)

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

Included in the following conference series:

Abstract

A Compact Directed Acyclic Word Graph (CDAWG) is a space-efficient text indexing structure, that can be used in several differ- ent string algorithms, especially in the analysis of biological sequences. In this paper, we present a new on-line algorithm for its construction, as well as the construction of a CDAWG for a set of strings.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM J. Computing, 22(5):935–948,1993.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Kärkkäinen. Suffix cactus: a cross between suffix tree and suffix array. Combinatorial Pattern Matching, 937:191–204, July 1995.

    Article  Google Scholar 

  3. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3):578–595, 1987.

    Article  MathSciNet  Google Scholar 

  4. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31–55, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  5. M. Crochemore and R. Verin, On compact directed acyclic word graphs, Springer Verlag LNCS 1261, pp.192–211, 1997.

    Google Scholar 

  6. D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, 1997.

    Book  MATH  Google Scholar 

  7. E. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262–272, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  8. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249–260, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa, On-line construction of compact directed acyclic word graphs. DOI Technical Report 183, Kyushu University, January 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Informatics, Kyushu University, Japan

    Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda & Setsuo Arikawa

  2. Dept. of Computer Science, Systems and Communication, University of Milan, Bicocca, Italy

    Giancarlo Mauri & Giulio Pavesi

Authors
  1. Shunsuke Inenaga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiromasa Hoshino
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ayumi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Masayuki Takeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Setsuo Arikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Giancarlo Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Giulio Pavesi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar-Ilan University, 52900, Ramat-Gan, Israel, Atlanta, Georgia, 30332-0280, USA

    Amihood Amir

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Inenaga, S. et al. (2001). On-Line Construction of Compact Directed Acyclic Word Graphs* . In: Amir, A. (eds) Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science, vol 2089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48194-X_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48194-X_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42271-6

  • Online ISBN: 978-3-540-48194-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation