{"id":"https://openalex.org/W2054182686","doi":"https://doi.org/10.1145/1774088.1774543","title":"Aho-Corasick like multiple subtree matching by pushdown automata","display_name":"Aho-Corasick like multiple subtree matching by pushdown automata","publication_year":2010,"publication_date":"2010-03-22","ids":{"openalex":"https://openalex.org/W2054182686","doi":"https://doi.org/10.1145/1774088.1774543","mag":"2054182686"},"language":"en","primary_location":{"id":"doi:10.1145/1774088.1774543","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1774088.1774543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 ACM Symposium on Applied Computing","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/A5024578874","display_name":"Tom\u00e1\u0161 Flouri","orcid":"https://orcid.org/0000-0002-8474-9507"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Tom\u00e1\u0161 Flouri","raw_affiliation_strings":["Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111868243","display_name":"Bo\u0159ivoj Melichar","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Bo\u0159ivoj Melichar","raw_affiliation_strings":["Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006012839","display_name":"Jan Janou\u0161ek","orcid":"https://orcid.org/0000-0001-9329-1000"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Janou\u0161ek","raw_affiliation_strings":["Czech Technical University in Prague, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5024578874"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.451,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72739653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2157","last_page":"2158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.763506293296814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6988330483436584},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6288537979125977},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6226990818977356},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49128860235214233},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4901178777217865},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4859706163406372},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.47430896759033203},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.46437540650367737},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46288296580314636},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.460064560174942},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.45507776737213135},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4343610107898712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4231100082397461},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4179784655570984},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.4108114540576935},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.3178524971008301},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3140811622142792},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.26179492473602295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21935725212097168},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.20912328362464905},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.14514568448066711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12007495760917664},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09995788335800171}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.763506293296814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6988330483436584},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6288537979125977},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6226990818977356},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49128860235214233},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4901178777217865},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4859706163406372},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.47430896759033203},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.46437540650367737},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46288296580314636},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.460064560174942},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.45507776737213135},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4343610107898712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4231100082397461},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4179784655570984},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.4108114540576935},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3178524971008301},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3140811622142792},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26179492473602295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21935725212097168},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.20912328362464905},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.14514568448066711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12007495760917664},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09995788335800171},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1774088.1774543","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1774088.1774543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 ACM Symposium on Applied Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G3301234355","display_name":null,"funder_award_id":"MSM 6840770014","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G5878032005","display_name":null,"funder_award_id":"201/09/0807","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2008108645","https://openalex.org/W2099964107","https://openalex.org/W2421250929","https://openalex.org/W4243221775"],"related_works":["https://openalex.org/W2160005349","https://openalex.org/W2047588061","https://openalex.org/W1804899877","https://openalex.org/W1990748319","https://openalex.org/W1949054594","https://openalex.org/W1965061701","https://openalex.org/W3150008488","https://openalex.org/W156810579","https://openalex.org/W2013588330","https://openalex.org/W1530061721"],"abstract_inverted_index":{"A":[0],"simple":[1],"yet":[2],"efficient":[3],"algorithm":[4,22],"to":[5,25],"find":[6],"all":[7],"occurrences":[8],"of":[9,12,34],"a":[10,15,35,39],"set":[11],"subtrees":[13],"in":[14,54],"subject":[16,52],"tree":[17,53],"is":[18,23,43],"described.":[19],"The":[20],"presented":[21],"similar":[24],"the":[26,46,51],"well-known":[27],"Aho-Corasick":[28],"string":[29],"matching":[30],"method":[31],"--":[32],"instead":[33],"deterministic":[36,40],"finite":[37],"automaton":[38,42],"pushdown":[41],"used":[44],"as":[45],"computation":[47],"model":[48],"for":[49],"reading":[50],"prefix":[55],"notation.":[56]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}