Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Suffix vector: a space-efficient suffix tree representation
School of Computer Science & Software Engineering, Monash University Melbourne.
Budapest University of Technology and Economics.
2001 (English)In: Algorithms and Computation: 12th International Symposium, ISAAC 2001 Christchurch, New Zealand, December 19-21, 2001 Proceedings / [ed] Peter Eades; Tadao Takaoka, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2001, p. 707-718Conference paper, Published paper (Refereed)
Abstract [en]

This paper introduces a new way of representing suffix trees. The basic idea behind the representation is that we are storing the nodes of the tree along with the string itself, thus edge labels can directly be read from the string. The new representation occupies less space than the best-known representation to date in case of English text and program files, though it requires slightly more space in case of DNA sequences. We also believe that our representation is clearer and thus implementing algorithms on it is easier. We also show that our representation is not only better in terms of space but it is also faster to retrieve information from the tree. We theoretically compare the running time of the matching statistics algorithm on both representations.

Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2001. p. 707-718
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2223
Identifiers
URN: urn:nbn:se:ltu:diva-31162DOI: 10.1007/3-540-45678-3Local ID: 53f44830-d00e-11dc-9ad7-000ea68e967bISBN: 978-3-540-42985-2 (print)OAI: oai:DiVA.org:ltu-31162DiVA, id: diva2:1004392
Conference
International Symposium on Algorithms and Computation : 19/12/2001 - 21/12/2001
Note
Upprättat; 2001; 20080131 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-06-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Zaslavsky, Arkady

Search in DiVA

By author/editor
Zaslavsky, Arkady

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 3 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf