{"id":"https://openalex.org/W1982026570","doi":"https://doi.org/10.1007/pl00009177","title":"From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction","display_name":"From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction","publication_year":1997,"publication_date":"1997-11-01","ids":{"openalex":"https://openalex.org/W1982026570","doi":"https://doi.org/10.1007/pl00009177","mag":"1982026570"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009177","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009177","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5086259996","display_name":"Robert Giegerich","orcid":null},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"R. Giegerich","raw_affiliation_strings":["Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , , , , , DE","Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , DE"],"affiliations":[{"raw_affiliation_string":"Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , , , , , DE","institution_ids":["https://openalex.org/I20121455"]},{"raw_affiliation_string":"Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , DE","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060071039","display_name":"Stefan Kurtz","orcid":"https://orcid.org/0000-0001-5783-0054"},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S. Kurtz","raw_affiliation_strings":["Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , , , , , DE","Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , DE"],"affiliations":[{"raw_affiliation_string":"Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , , , , , DE","institution_ids":["https://openalex.org/I20121455"]},{"raw_affiliation_string":"Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , DE","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086259996"],"corresponding_institution_ids":["https://openalex.org/I20121455"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.0188,"has_fulltext":false,"cited_by_count":159,"citation_normalized_percentile":{"value":0.91295158,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"3","first_page":"331","last_page":"353"},"is_retracted":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/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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/1702","display_name":"Artificial Intelligence"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/theory-of-computation","display_name":"Theory of computation","score":0.7464403510093689},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.7292475700378418},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6734075546264648},{"id":"https://openalex.org/keywords/terminology","display_name":"Terminology","score":0.6144613027572632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6072402000427246},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.6052734851837158},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4990832805633545},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.4963448643684387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4684567451477051},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.4651416838169098},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4178573489189148},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3744394779205322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.344363808631897},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22261646389961243},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.10816189646720886},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08636236190795898}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7464403510093689},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.7292475700378418},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6734075546264648},{"id":"https://openalex.org/C547195049","wikidata":"https://www.wikidata.org/wiki/Q1725664","display_name":"Terminology","level":2,"score":0.6144613027572632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6072402000427246},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.6052734851837158},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4990832805633545},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.4963448643684387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4684567451477051},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.4651416838169098},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4178573489189148},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3744394779205322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.344363808631897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22261646389961243},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.10816189646720886},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08636236190795898},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/pl00009177","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009177","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.489.6807","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.489.6807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.zbh.uni-hamburg.de/pubs/pdf/GieKur1997.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.9399","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.uni-bielefeld.de/pub/papers/techfak/pi/WMUAlgorithmica.ps.gz","raw_type":"text"},{"id":"pmh:oai:pub.librecat.org:1627522","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/1627522","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Giegerich R, Kurtz S. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. <em>ALGORITHMICA</em>. 1997;19(3):331-353.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W114080009","https://openalex.org/W163388907","https://openalex.org/W1485516007","https://openalex.org/W1513153538","https://openalex.org/W1515216880","https://openalex.org/W1518828882","https://openalex.org/W1529615245","https://openalex.org/W1551265161","https://openalex.org/W1571053466","https://openalex.org/W1653707015","https://openalex.org/W1972770363","https://openalex.org/W2023186784","https://openalex.org/W2029135821","https://openalex.org/W2043481183","https://openalex.org/W2055417893","https://openalex.org/W2070857641","https://openalex.org/W2099964107","https://openalex.org/W2100451901","https://openalex.org/W2121252285","https://openalex.org/W2395807140","https://openalex.org/W2533248932","https://openalex.org/W2611477341","https://openalex.org/W2752885492","https://openalex.org/W2753176400"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W1517600056","https://openalex.org/W1575722140","https://openalex.org/W2036633468","https://openalex.org/W2160738675","https://openalex.org/W1548907175","https://openalex.org/W4293529780","https://openalex.org/W3022556214","https://openalex.org/W2405892617","https://openalex.org/W2003608043"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":12},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}