{"id":"https://openalex.org/W1817697125","doi":"https://doi.org/10.1109/dcc.2004.1281531","title":"Online suffix trees with counts","display_name":"Online suffix trees with counts","alternate_titles":[],"publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W1817697125","doi":"https://doi.org/10.1109/dcc.2004.1281531","mag":"1817697125"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281531","doi":"https://doi.org/10.1109/dcc.2004.1281531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281531","pdf_url":null,"source":{"id":"https://openalex.org/S4210220829","display_name":"DCC","issn_l":"1068-0314","issn":["1068-0314","2375-0359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W1817697125"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113670236","display_name":"Breannd\u00e1n \u00d3 Nuall\u00e1in","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"B.O. Nuallain","raw_affiliation_strings":["Faculty of Science, University of Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science, University of Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110211907","display_name":"Steven de Rooij","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"S. de Rooij","raw_affiliation_strings":["Centrum voor Wiskunde en Informatica (CWI), Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum voor Wiskunde en Informatica (CWI), Amsterdam, Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1923,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.28185907,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"555","last_page":"555"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/suffix-trees","display_name":"suffix trees","score":0.8379999995231628}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8625733852386475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7350935935974121},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.6620748043060303},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6550214290618896},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5376288890838623},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5360996723175049},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.5288844108581543},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5219204425811768},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5050941109657288},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4631487727165222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45950764417648315},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3930928707122803},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37060993909835815},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3442849814891815},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.218930184841156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18348640203475952},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06600835919380188},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/dcc.2004.1281531","doi":"https://doi.org/10.1109/dcc.2004.1281531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281531","pdf_url":null,"source":{"id":"https://openalex.org/S4210220829","display_name":"DCC","issn_l":"1068-0314","issn":["1068-0314","2375-0359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/847cd7b9-bd7e-4a87-85d3-229841d87380","doi":null,"is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/online-suffix-trees-with-counts(847cd7b9-bd7e-4a87-85d3-229841d87380).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"\u00d3 Nuall\u00e1in, B S & de Rooij, S 2004, Online Suffix Trees with Counts. in Proceedings of the Data Compression Conference 2004.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/847cd7b9-bd7e-4a87-85d3-229841d87380","doi":null,"is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/online-suffix-trees-with-counts(847cd7b9-bd7e-4a87-85d3-229841d87380).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Data Compression Conference 2004","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.7394","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.7394","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csdl.computer.org/comp/proceedings/dcc/2004/2082/00/20820555.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W1601718731"],"related_works":["https://openalex.org/W1982026570","https://openalex.org/W1499535154","https://openalex.org/W7095952705","https://openalex.org/W192080074","https://openalex.org/W2949094631","https://openalex.org/W1985059829","https://openalex.org/W4402586541","https://openalex.org/W7096592307","https://openalex.org/W288569921","https://openalex.org/W2623787628"],"abstract_inverted_index":{"This":[0,25],"paper":[1],"extend":[2],"Ukkonen's":[3,40],"online":[4,41],"suffix":[5],"tree":[6],"construction":[7,42],"algorithm":[8,43],"to":[9,18,117],"support":[10],"substring":[11],"frequency":[12,124],"queries,":[13],"by":[14],"adding":[15],"count":[16,120],"fields":[17,121],"the":[19,23,29,53,65,113,119],"internal":[20,101],"nodes":[21,102],"of":[22,31,49,58,85],"tree.":[24,54],"has":[26],"applications":[27],"in":[28,52,135],"field":[30],"sequential":[32],"data":[33],"compression.":[34],"One":[35],"major":[36,56],"problem":[37],"is":[38,92],"that":[39,75,97],"does":[44],"not":[45],"maintain":[46],"explicit":[47],"end":[48,66,87,108],"string":[50],"markers":[51,67,88],"The":[55],"part":[57],"our":[59],"work":[60],"concerns":[61],"quickly":[62],"determining":[63],"where":[64],"for":[68],"a":[69,82],"particular":[70],"edge":[71],"would":[72],"be,":[73],"so":[74],"frequencies":[76],"can":[77,103],"be":[78],"correctly":[79],"obtained.":[80],"So":[81],"complete":[83],"characterization":[84],"all":[86],"on":[89],"leaf":[90],"edges":[91,98],"given.":[93],"Furthermore":[94],"we":[95],"found":[96],"between":[99],"two":[100],"contain":[104],"at":[105],"most":[106],"one":[107],"marker.":[109],"Using":[110],"these":[111],"results,":[112],"algorithms":[114,128],"are":[115],"given":[116],"update":[118],"and":[122,132],"do":[123],"queries":[125],"correctly.":[126],"All":[127],"have":[129],"been":[130],"implemented":[131],"tested":[133],"correct":[134],"practice.":[136]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1817697125","counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
