File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Compressed index for a dynamic collection of texts
  • Basic View
  • Metadata View
  • XML View
TitleCompressed index for a dynamic collection of texts
 
AuthorsChan, HL1
Hon, WK1
Lam, TW1
 
Issue Date2004
 
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
 
CitationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3109, p. 445-456 [How to Cite?]
 
AbstractLet T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (i.e., O(n) bits), while supporting very efficient pattern matching [2, 4]. This paper extends the work on optimal-space indexing to a dynamic collection of texts. Precisely, we give a compressed index using O(n) bits where n is the total length of texts, such that searching for a pattern P takes O(|P| log n + occ log2 n) time where occ is the number of occurrences, and inserting or deleting a text T takes O(|T| log n) time. © Springer-Verlag 2004.
 
ISSN0302-9743
2012 SCImago Journal Rankings: 0.332
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorChan, HL
 
dc.contributor.authorHon, WK
 
dc.contributor.authorLam, TW
 
dc.date.accessioned2010-09-25T15:00:41Z
 
dc.date.available2010-09-25T15:00:41Z
 
dc.date.issued2004
 
dc.description.abstractLet T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (i.e., O(n) bits), while supporting very efficient pattern matching [2, 4]. This paper extends the work on optimal-space indexing to a dynamic collection of texts. Precisely, we give a compressed index using O(n) bits where n is the total length of texts, such that searching for a pattern P takes O(|P| log n + occ log2 n) time where occ is the number of occurrences, and inserting or deleting a text T takes O(|T| log n) time. © Springer-Verlag 2004.
 
dc.description.natureLink_to_subscribed_fulltext
 
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3109, p. 445-456 [How to Cite?]
 
dc.identifier.epage456
 
dc.identifier.hkuros107889
 
dc.identifier.issn0302-9743
2012 SCImago Journal Rankings: 0.332
 
dc.identifier.scopuseid_2-s2.0-35048868341
 
dc.identifier.spage445
 
dc.identifier.urihttp://hdl.handle.net/10722/93422
 
dc.identifier.volume3109
 
dc.languageeng
 
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
 
dc.publisher.placeGermany
 
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 
dc.relation.referencesReferences in Scopus
 
dc.titleCompressed index for a dynamic collection of texts
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Chan, HL</contributor.author>
<contributor.author>Hon, WK</contributor.author>
<contributor.author>Lam, TW</contributor.author>
<date.accessioned>2010-09-25T15:00:41Z</date.accessioned>
<date.available>2010-09-25T15:00:41Z</date.available>
<date.issued>2004</date.issued>
<identifier.citation>Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3109, p. 445-456</identifier.citation>
<identifier.issn>0302-9743</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/93422</identifier.uri>
<description.abstract>Let T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (i.e., O(n) bits), while supporting very efficient pattern matching [2, 4]. This paper extends the work on optimal-space indexing to a dynamic collection of texts. Precisely, we give a compressed index using O(n) bits where n is the total length of texts, such that searching for a pattern P takes O(|P| log n + occ log2 n) time where occ is the number of occurrences, and inserting or deleting a text T takes O(|T| log n) time. &#169; Springer-Verlag 2004.</description.abstract>
<language>eng</language>
<publisher>Springer Verlag. The Journal&apos;s web site is located at http://springerlink.com/content/105633/</publisher>
<relation.ispartof>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</relation.ispartof>
<title>Compressed index for a dynamic collection of texts</title>
<type>Article</type>
<description.nature>Link_to_subscribed_fulltext</description.nature>
<identifier.scopus>eid_2-s2.0-35048868341</identifier.scopus>
<identifier.hkuros>107889</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-35048868341&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>3109</identifier.volume>
<identifier.spage>445</identifier.spage>
<identifier.epage>456</identifier.epage>
<publisher.place>Germany</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong