{"id":"https://openalex.org/W2145020325","doi":"https://doi.org/10.1109/enc.2004.1342587","title":"On the algorithm of berztiss for tree pattern matching","display_name":"On the algorithm of berztiss for tree pattern matching","publication_year":2004,"publication_date":"2004-11-08","ids":{"openalex":"https://openalex.org/W2145020325","doi":"https://doi.org/10.1109/enc.2004.1342587","mag":"2145020325"},"language":"en","primary_location":{"id":"doi:10.1109/enc.2004.1342587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/enc.2004.1342587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","raw_type":"proceedings-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/A5005629452","display_name":"Gabriel Valiente","orcid":"https://orcid.org/0000-0001-9194-2703"},"institutions":[{"id":"https://openalex.org/I71999127","display_name":"Universitat de Barcelona","ror":"https://ror.org/021018s57","country_code":"ES","type":"education","lineage":["https://openalex.org/I71999127"]},{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"G. Valiente","raw_affiliation_strings":["Department of Software, Technical University of Catalonia, Barcelona, Spain","Dept. of Software, Catalonia Tech. Univ., Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Department of Software, Technical University of Catalonia, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]},{"raw_affiliation_string":"Dept. of Software, Catalonia Tech. Univ., Barcelona, Spain","institution_ids":["https://openalex.org/I71999127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005629452"],"corresponding_institution_ids":["https://openalex.org/I71999127","https://openalex.org/I9617848"],"apc_list":null,"apc_paid":null,"fwci":0.8994,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81688894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"1","issue":null,"first_page":"43","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9980999827384949,"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.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/k-ary-tree","display_name":"K-ary tree","score":0.7572324275970459},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.7550709247589111},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6662578582763672},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6387479305267334},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5535271763801575},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5436020493507385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5199881196022034},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4822993278503418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4743441641330719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4434620141983032},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4405437707901001},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.4391374886035919},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4351048469543457},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.40404558181762695},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3655024766921997},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3417661190032959},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2248649299144745},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.19962507486343384}],"concepts":[{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.7572324275970459},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.7550709247589111},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6662578582763672},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6387479305267334},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5535271763801575},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5436020493507385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5199881196022034},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4822993278503418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4743441641330719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4434620141983032},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4405437707901001},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.4391374886035919},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4351048469543457},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.40404558181762695},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3655024766921997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3417661190032959},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2248649299144745},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.19962507486343384},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/enc.2004.1342587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/enc.2004.1342587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W9273873","https://openalex.org/W1520385431","https://openalex.org/W1559144499","https://openalex.org/W1726808842","https://openalex.org/W1971239730","https://openalex.org/W1993449345","https://openalex.org/W2040864705","https://openalex.org/W2054072512","https://openalex.org/W2081508431","https://openalex.org/W2091274854","https://openalex.org/W2154965336","https://openalex.org/W2421250929","https://openalex.org/W2434820933","https://openalex.org/W2611477341","https://openalex.org/W4300098826","https://openalex.org/W6643191781"],"related_works":["https://openalex.org/W4244673516","https://openalex.org/W2107381954","https://openalex.org/W2022598760","https://openalex.org/W1999216101","https://openalex.org/W2125650843","https://openalex.org/W22108090","https://openalex.org/W1850638833","https://openalex.org/W2592730620","https://openalex.org/W2007609084","https://openalex.org/W2145020325"],"abstract_inverted_index":{"The":[0,57],"tree":[1,14,46,58],"pattern":[2,15,28,47,59,100],"matching":[3,16,48,60],"problem":[4],"over":[5],"labeled":[6],"trees":[7],"is":[8,64,68,73,92,98],"addressed":[9],"in":[10,81],"This":[11],"work.":[12],"Several":[13],"algorithms":[17],"are":[18,21],"known":[19],"which":[20,50],"based":[22],"on":[23,87],"the":[24,27,54,82,88,93,99],"decomposition":[25],"of":[26,62],"into":[29],"strings,":[30],"with":[31],"each":[32],"string":[33],"representing":[34],"a":[35,44],"root-to-leaf":[36],"path.":[37],"Among":[38],"these,":[39],"Alfs":[40],"T.":[41],"Berztiss":[42,63],"gave":[43],"simple":[45],"algorithm":[49,61],"remained":[51],"unknown":[52],"to":[53,75],"research":[55],"community.":[56],"reviewed,":[65],"its":[66,71],"correctness":[67],"established,":[69],"and":[70,79,85,96],"complexity":[72],"shown":[74],"be":[76],"O(mn)":[77],"time":[78],"space":[80],"worst":[83],"case":[84],"O(n)":[86],"average,":[89],"where":[90],"n":[91],"text":[94],"size":[95],"m":[97],"size.":[101]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}