File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Dynamic suffix tree and two-dimensional texts management

TitleDynamic suffix tree and two-dimensional texts management
Authors
Choi, YLam, TW
KeywordsAlgorithms
Data Structures
Dictionary Problem
Pattern Matching
Suffix Trees
Two-Dimensional Information Retrieval
Issue Date1997
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl
Citation
Information Processing Letters, 1997, v. 61 n. 4, p. 213-220 How to Cite?
AbstractThis paper contains two results. First, it gives a new implementation of a dynamic suffix tree, which can manage a set of strings in a space conserving manner. Second, it presents an improved data structure for storing, searching and updating a library of two-dimensional texts. This result improves the previously best scheme, the s-trees of Giancarlo (1993), as regards the time complexity of both the search and the update operations. In particular, the search operation is as fast as that of the best static solution (which assumes the texts are fixed). © 1997 Published by Elsevier Science B.V.
Persistent Identifierhttp://hdl.handle.net/10722/152299
ISSN
0020-0190
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.404
ISI Accession Number ID
WOS:A1997WP28400008
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChoi, Yen_US
dc.contributor.authorLam, TWen_US
dc.date.accessioned2012-06-26T06:37:01Z-
dc.date.available2012-06-26T06:37:01Z-
dc.date.issued1997en_US
dc.identifier.citationInformation Processing Letters, 1997, v. 61 n. 4, p. 213-220en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/10722/152299-
dc.description.abstractThis paper contains two results. First, it gives a new implementation of a dynamic suffix tree, which can manage a set of strings in a space conserving manner. Second, it presents an improved data structure for storing, searching and updating a library of two-dimensional texts. This result improves the previously best scheme, the s-trees of Giancarlo (1993), as regards the time complexity of both the search and the update operations. In particular, the search operation is as fast as that of the best static solution (which assumes the texts are fixed). © 1997 Published by Elsevier Science B.V.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/iplen_US
dc.relation.ispartofInformation Processing Lettersen_US
dc.rightsInformation Processing Letters. Copyright © Elsevier BV.-
dc.subjectAlgorithmsen_US
dc.subjectData Structuresen_US
dc.subjectDictionary Problemen_US
dc.subjectPattern Matchingen_US
dc.subjectSuffix Treesen_US
dc.subjectTwo-Dimensional Information Retrievalen_US
dc.titleDynamic suffix tree and two-dimensional texts managementen_US
dc.typeArticleen_US
dc.identifier.emailLam, TW:twlam@cs.hku.hken_US
dc.identifier.authorityLam, TW=rp00135en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0042722296en_US
dc.identifier.hkuros25142-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0042722296&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume61en_US
dc.identifier.issue4en_US
dc.identifier.spage213en_US
dc.identifier.epage220en_US
dc.identifier.isiWOS:A1997WP28400008-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridChoi, Y=54792517700en_US
dc.identifier.scopusauthoridLam, TW=7202523165en_US
dc.identifier.issnl0020-0190-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats