Optimal Suffix Tree Construction with Large Alphabets. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/focs/Farach97>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Martin_Farach>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1997.646102>
foaf:homepage	<https://doi.org/10.1109/SFCS.1997.646102>
dc:identifier	DBLP conf/focs/Farach97 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FSFCS.1997.646102 (xsd:string)
dcterms:issued	1997 (xsd:gYear)
rdfs:label	Optimal Suffix Tree Construction with Large Alphabets. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Martin_Farach>
swrc:pages	137-143 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/focs/1997>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/focs/Farach97/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/focs/Farach97>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/focs/focs97.html#Farach97>
rdfs:seeAlso	<https://doi.org/10.1109/SFCS.1997.646102>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject	pattern matching; suffix tree; large alphabets; data structure; combinatorial pattern matching; integer alphabet; sorting; integer alphabets (xsd:string)
dc:title	Optimal Suffix Tree Construction with Large Alphabets. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document