File Download
 
 
Supplementary

Conference Paper: A space adn time efficient algorithm for constructing compressed suffix arragys
  • Basic View
  • Metadata View
  • XML View
TitleA space adn time efficient algorithm for constructing compressed suffix arragys
 
AuthorsLam, TW
Sadakane, K
Sung, WK
Yiu, SM
 
Issue Date2002
 
PublisherSpringer.
 
CitationProceedings of the 8th Annual International Computing and Combinatorics Conference, p. 401-410 [How to Cite?]
 
DC FieldValue
dc.contributor.authorLam, TW
 
dc.contributor.authorSadakane, K
 
dc.contributor.authorSung, WK
 
dc.contributor.authorYiu, SM
 
dc.date.accessioned2010-09-25T15:01:57Z
 
dc.date.available2010-09-25T15:01:57Z
 
dc.date.issued2002
 
dc.identifier.citationProceedings of the 8th Annual International Computing and Combinatorics Conference, p. 401-410 [How to Cite?]
 
dc.identifier.epage410
 
dc.identifier.hkuros74885
 
dc.identifier.spage401
 
dc.identifier.urihttp://hdl.handle.net/10722/93464
 
dc.languageeng
 
dc.publisherSpringer.
 
dc.relation.ispartofProceedings of the 8th Annual International Computing and Combinatorics Conference
 
dc.titleA space adn time efficient algorithm for constructing compressed suffix arragys
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Lam, TW</contributor.author>
<contributor.author>Sadakane, K</contributor.author>
<contributor.author>Sung, WK</contributor.author>
<contributor.author>Yiu, SM</contributor.author>
<date.accessioned>2010-09-25T15:01:57Z</date.accessioned>
<date.available>2010-09-25T15:01:57Z</date.available>
<date.issued>2002</date.issued>
<identifier.citation>Proceedings of the 8th Annual International Computing and Combinatorics Conference, p. 401-410</identifier.citation>
<identifier.uri>http://hdl.handle.net/10722/93464</identifier.uri>
<language>eng</language>
<publisher>Springer.</publisher>
<relation.ispartof>Proceedings of the 8th Annual International Computing and Combinatorics Conference</relation.ispartof>
<title>A space adn time efficient algorithm for constructing compressed suffix arragys</title>
<type>Conference_Paper</type>
<identifier.hkuros>74885</identifier.hkuros>
<identifier.spage>401</identifier.spage>
<identifier.epage>410</identifier.epage>
</item>