{"id":"https://openalex.org/W2089310963","doi":"https://doi.org/10.1145/1024694.1024698","title":"An optimal algorithm for querying tree structures and its applications in bioinformatics","display_name":"An optimal algorithm for querying tree structures and its applications in bioinformatics","publication_year":2004,"publication_date":"2004-06-01","ids":{"openalex":"https://openalex.org/W2089310963","doi":"https://doi.org/10.1145/1024694.1024698","mag":"2089310963"},"language":"en","primary_location":{"id":"doi:10.1145/1024694.1024698","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1024694.1024698","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMOD Record","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/A5051017858","display_name":"Hsiao-Fei Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Hsiao-Fei Liu","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046181967","display_name":"Ya\u2010Hui Chang","orcid":"https://orcid.org/0000-0002-7865-9919"},"institutions":[{"id":"https://openalex.org/I153512688","display_name":"National Taiwan Ocean University","ror":"https://ror.org/03bvvnt49","country_code":"TW","type":"education","lineage":["https://openalex.org/I153512688"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ya-Hui Chang","raw_affiliation_strings":["National Taiwan Ocean University, Keelung, Taiwan"],"affiliations":[{"raw_affiliation_string":"National Taiwan Ocean University, Keelung, Taiwan","institution_ids":["https://openalex.org/I153512688"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033888490","display_name":"Kun\u2010Mao Chao","orcid":"https://orcid.org/0000-0003-2837-1279"},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kun-Mao Chao","raw_affiliation_strings":["National Taiwan University, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"National Taiwan University, Taipei, Taiwan","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051017858"],"corresponding_institution_ids":["https://openalex.org/I16733864"],"apc_list":null,"apc_paid":null,"fwci":0.4625,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.75964193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"33","issue":"2","first_page":"21","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9994000196456909,"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/T12029","display_name":"DNA and Biological Computing","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.8246163129806519},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6323464512825012},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.607544481754303},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4683462977409363},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.46726101636886597},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.44588884711265564},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.419036328792572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35523104667663574},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.34555524587631226},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30754992365837097},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3072033226490021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17486786842346191},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1285993754863739}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8246163129806519},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6323464512825012},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.607544481754303},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4683462977409363},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.46726101636886597},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.44588884711265564},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.419036328792572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35523104667663574},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.34555524587631226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30754992365837097},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3072033226490021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17486786842346191},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1285993754863739}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1024694.1024698","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1024694.1024698","pdf_url":null,"source":{"id":"https://openalex.org/S47508943","display_name":"ACM SIGMOD Record","issn_l":"0163-5808","issn":["0163-5808","1943-5835"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMOD Record","raw_type":"journal-article"},{"id":"pmh:oai:140.112.114.62:246246/154514","is_oa":false,"landing_page_url":"http://ntur.lib.ntu.edu.tw//handle/246246/154514","pdf_url":null,"source":{"id":"https://openalex.org/S4306402491","display_name":"NTUR (\u81fa\u7063\u6a5f\u69cb\u5178\u85cf)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I16733864","host_organization_name":"National Taiwan University","host_organization_lineage":["https://openalex.org/I16733864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:140.112.114.62:246246/193613","is_oa":false,"landing_page_url":"http://ntur.lib.ntu.edu.tw//handle/246246/193613","pdf_url":null,"source":{"id":"https://openalex.org/S4306402491","display_name":"NTUR (\u81fa\u7063\u6a5f\u69cb\u5178\u85cf)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I16733864","host_organization_name":"National Taiwan University","host_organization_lineage":["https://openalex.org/I16733864"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.102.2671","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.2671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csie.ntu.edu.tw/~kmchao/papers/2004_SIGMOD_Record.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1022.7344","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1022.7344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Ya-Hui_Chang/publication/220415809_An_Optimal_Algorithm_for_Querying_Tree_Structures_and_its_Applications_in_Bioinformatics/links/09e41508a479f6155d000000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1488310749","https://openalex.org/W1990061958","https://openalex.org/W2030507181","https://openalex.org/W2035902703","https://openalex.org/W2050137450","https://openalex.org/W2051158076","https://openalex.org/W2126194147","https://openalex.org/W2139475358","https://openalex.org/W2142237411","https://openalex.org/W2148154295","https://openalex.org/W2151214225","https://openalex.org/W2320748401","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2950176494","https://openalex.org/W1531393700","https://openalex.org/W1665790140","https://openalex.org/W4388320048","https://openalex.org/W1545960079","https://openalex.org/W2183636263","https://openalex.org/W1524393328","https://openalex.org/W2467744109","https://openalex.org/W1559350420","https://openalex.org/W2912257407"],"abstract_inverted_index":{"Trees":[0],"and":[1,72,90],"graphs":[2],"are":[3],"widely":[4],"used":[5],"to":[6,13],"model":[7],"biological":[8],"databases.":[9],"Providing":[10],"efficient":[11],"algorithms":[12],"support":[14],"tree-based":[15],"or":[16],"graph-based":[17],"querying":[18,84],"is":[19,67,74,88,103],"therefore":[20],"an":[21,29],"important":[22],"issue.":[23],"In":[24],"this":[25],"paper,":[26],"we":[27],"propose":[28],"optimal":[30],"algorithm":[31],"which":[32],"can":[33],"answer":[34],"the":[35,40,68,75,81,104,109],"following":[36],"question:":[37],"\"Where":[38],"do":[39],"root-to-leaf":[41],"paths":[42],"of":[43,70,83,106],"a":[44,85],"rooted":[45,52],"labeled":[46,53],"tree":[47,54],"Q":[48,71],"occur":[49],"in":[50,57,108],"another":[51],"T":[55],"?\"":[56],"time":[58],"O":[59],"(":[60],"m":[61,66],"+":[62],"Occ":[63,73],"),":[64],"where":[65,101],"size":[69],"output":[76],"size.":[77],"We":[78],"also":[79],"show":[80],"problem":[82],"general":[86],"graph":[87],"NP-complete":[89],"not":[91],"approximable":[92],"within":[93],"n":[94,102],"k":[95,98],"for":[96],"any":[97],"<":[99],"1,":[100],"number":[105],"nodes":[107],"queried":[110],"graph,":[111],"unless":[112],"P":[113],"=":[114],"NP.":[115]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}