{"id":"https://openalex.org/W2047394821","doi":"https://doi.org/10.1142/s012905410600439x","title":"TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING","display_name":"TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING","publication_year":2006,"publication_date":"2006-12-01","ids":{"openalex":"https://openalex.org/W2047394821","doi":"https://doi.org/10.1142/s012905410600439x","mag":"2047394821"},"language":"en","primary_location":{"id":"doi:10.1142/s012905410600439x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410600439x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5043799147","display_name":"Loek Cleophas","orcid":"https://orcid.org/0000-0002-7221-3676"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"LOEK CLEOPHAS","raw_affiliation_strings":[",  Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands",", Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":",  Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":", Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066197178","display_name":"Kees Hemerik","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"KEES HEMERIK","raw_affiliation_strings":[",  Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands",", Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":",  Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":", Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018562418","display_name":"G. Zwaan","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"GERARD ZWAAN","raw_affiliation_strings":[",  Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands",", Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":",  Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":", Software Engineering & Technology Group, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P. O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.3238,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62343566,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"17","issue":"06","first_page":"1253","last_page":"1272"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7222437262535095},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6738216280937195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6133666038513184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5625982880592346},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5512470006942749},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.5053889751434326},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.49199482798576355},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4217737019062042},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.42096567153930664},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4008512794971466},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2939313054084778},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2889692783355713},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.1700133979320526},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1294192373752594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1143750548362732}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7222437262535095},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6738216280937195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6133666038513184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5625982880592346},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5512470006942749},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.5053889751434326},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.49199482798576355},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4217737019062042},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.42096567153930664},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4008512794971466},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2939313054084778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2889692783355713},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.1700133979320526},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1294192373752594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1143750548362732},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s012905410600439x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410600439x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/1154d57c-94fe-41dd-bb87-0f65c00e7ffa","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/1154d57c-94fe-41dd-bb87-0f65c00e7ffa","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cleophas, L G W A, Hemerik, C & Zwaan, G 2006, 'Two related algorithms for root-to-frontier tree pattern matching', International Journal of Foundations of Computer Science, vol. 17, no. 6, pp. 1253-1272. https://doi.org/10.1142/S012905410600439X","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:624430","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=624430","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0129-0541","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:624430","is_oa":false,"landing_page_url":"http://repository.tue.nl/624430","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0129-0541","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/1154d57c-94fe-41dd-bb87-0f65c00e7ffa","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/1154d57c-94fe-41dd-bb87-0f65c00e7ffa","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,"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":"International Journal of Foundations of Computer Science, 17(6), 1253 - 1272. World Scientific","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":8,"referenced_works":["https://openalex.org/W1981565634","https://openalex.org/W2040864705","https://openalex.org/W2057455870","https://openalex.org/W2099964107","https://openalex.org/W2103953153","https://openalex.org/W2140319468","https://openalex.org/W2421250929","https://openalex.org/W4211152277"],"related_works":["https://openalex.org/W1764947202","https://openalex.org/W1577306287","https://openalex.org/W2060032524","https://openalex.org/W1988549452","https://openalex.org/W2023968088","https://openalex.org/W2022598760","https://openalex.org/W1994389053","https://openalex.org/W1980641815","https://openalex.org/W232438323","https://openalex.org/W1786504122"],"abstract_inverted_index":{"Tree":[0],"pattern":[1],"matching":[2,106],"(TPM)":[3],"algorithms":[4,24,87,121],"on":[5,31,74],"ordered,":[6],"ranked":[7],"trees":[8],"play":[9],"an":[10,75],"important":[11],"role":[12],"in":[13,26,107],"applications":[14],"such":[15],"as":[16],"compilers":[17],"and":[18,53,86,125],"term":[19],"rewriting":[20],"systems.":[21],"Many":[22],"TPM":[23,56,71,110,120],"appearing":[25],"the":[27,133,136,140],"literature":[28],"are":[29,47],"based":[30,73],"tree":[32,44,79,89,128],"automata.":[33,129],"For":[34],"efficiency,":[35],"these":[36],"automata":[37,45,90,124,137],"should":[38],"be":[39,102],"deterministic,":[40],"yet":[41],"deterministic":[42],"root-to-frontier":[43,55,70,109],"(DRFTAS)":[46],"less":[48],"powerful":[49],"than":[50],"nondeterministic":[51],"ones,":[52],"no":[54],"algorithm":[57,72,85,114],"using":[58,88,122,127],"a":[59,69,98,108,116],"DRFTA":[60,100],"has":[61,91],"appeared":[62],"so":[63],"far.":[64],"Hoffmann":[65],"&":[66],"O'Donnell":[67],"presented":[68],"Aho-Corasick":[76],"automaton":[77],"recognizing":[78],"stringpaths.":[80],"No":[81],"relationship":[82],"between":[83,119,135],"this":[84],"however":[92],"been":[93],"described.":[94],"We":[95,130],"show":[96],"that":[97],"specific":[99],"can":[101],"used":[103,138],"for":[104],"stringpath":[105,123],"algorithm.":[111],"This":[112],"new":[113],"provides":[115],"missing":[117],"link":[118],"those":[126],"also":[131],"investigate":[132],"correspondence":[134],"by":[139],"two":[141],"algorithms.":[142]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}