{"id":"https://openalex.org/W206238946","doi":null,"title":"Enumerating All Maximal Frequent Subtrees","display_name":"Enumerating All Maximal Frequent Subtrees","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W206238946","mag":"206238946"},"language":"en","primary_location":{"id":"pmh:oai:lib.dr.iastate.edu:cs_techreports-1052","doi":null,"is_oa":true,"landing_page_url":"https://lib.dr.iastate.edu/cs_techreports/54","pdf_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1052&context=cs_techreports","source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Technical Reports","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1052&context=cs_techreports","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042903304","display_name":"Akshay Deepak","orcid":"https://orcid.org/0000-0001-6854-8599","observed_orcids":["https://orcid.org/0000-0001-6854-8599"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akshay Deepak","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6854-8599","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070873690","display_name":"David Fern\u00e1ndez\u2010Baca","orcid":"https://orcid.org/0000-0002-8563-3637","observed_orcids":["https://orcid.org/0000-0002-8563-3637"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Fern\u00e1ndez\u2010Baca","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8563-3637","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.92330002784729,"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"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.92330002784729,"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/T11269","display_name":"Algorithms and Data Compression","score":0.027499999850988388,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.007400000002235174,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/maximum-agreement-subtree","display_name":"maximum agreement subtree","score":0.8529999852180481},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"phylogenetic tree","score":0.9039999842643738},{"id":"https://openalex.org/keywords/enumeration","display_name":"enumeration","score":0.4429999887943268},{"id":"https://openalex.org/keywords/consensus-trees","display_name":"consensus trees","score":0.75},{"id":"https://openalex.org/keywords/tree-similarity","display_name":"tree similarity","score":0.847000002861023},{"id":"https://openalex.org/keywords/horizontal-gene-transfer","display_name":"horizontal gene transfer","score":0.6669999957084656}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.544218122959137},{"id":"https://openalex.org/C2779655021","wikidata":"https://www.wikidata.org/wiki/Q1907811","display_name":"Mast (botany)","level":3,"score":0.5163756608963013},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5146065950393677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5030309557914734},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4456367492675781},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42465871572494507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3841095566749573},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.2684609293937683},{"id":"https://openalex.org/C2779726688","wikidata":"https://www.wikidata.org/wiki/Q191989","display_name":"Mast cell","level":2,"score":0.11625674366950989},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0907677412033081},{"id":"https://openalex.org/C203014093","wikidata":"https://www.wikidata.org/wiki/Q101929","display_name":"Immunology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:lib.dr.iastate.edu:cs_techreports-1052","doi":null,"is_oa":true,"landing_page_url":"https://lib.dr.iastate.edu/cs_techreports/54","pdf_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1052&context=cs_techreports","source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Technical Reports","raw_type":"text"},{"id":"mag:206238946","doi":null,"is_oa":false,"landing_page_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1052&context=cs_techreports","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:lib.dr.iastate.edu:cs_techreports-1052","doi":null,"is_oa":true,"landing_page_url":"https://lib.dr.iastate.edu/cs_techreports/54","pdf_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1052&context=cs_techreports","source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Technical Reports","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G6121493126","display_name":"Collaborative Research: Phylogenetic Trees for Comparative Biology","funder_award_id":"0829674","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W206238946.pdf","grobid_xml":"https://content.openalex.org/works/W206238946.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1963749031","https://openalex.org/W1967732276","https://openalex.org/W1968300516","https://openalex.org/W1991701064","https://openalex.org/W2009758120","https://openalex.org/W2022240075","https://openalex.org/W2030996579","https://openalex.org/W2048362786","https://openalex.org/W2068383400","https://openalex.org/W2071695618","https://openalex.org/W2075503802","https://openalex.org/W2085251214","https://openalex.org/W2095523744","https://openalex.org/W2098913342","https://openalex.org/W2101156500","https://openalex.org/W2114137166","https://openalex.org/W2124310341","https://openalex.org/W2140158493","https://openalex.org/W2152397843","https://openalex.org/W2156668042","https://openalex.org/W2159293599","https://openalex.org/W2162481448","https://openalex.org/W2175362637","https://openalex.org/W2600246321"],"related_works":["https://openalex.org/W2004446301","https://openalex.org/W1979781836","https://openalex.org/W2125076159","https://openalex.org/W2138780502","https://openalex.org/W7096444855","https://openalex.org/W2152397843","https://openalex.org/W7098553925","https://openalex.org/W7100119162","https://openalex.org/W7099627370","https://openalex.org/W2048362786"],"abstract_inverted_index":{"Given":[0],"a":[1,7,11,16,21,68,85,112,127,186,197,202,213],"collection":[2,150],"of":[3,30,52,121,142,178,189,210,217,232,238],"leaf-labeled":[4],"trees":[5,124,249],"on":[6,149,259],"common":[8,166],"leafset":[9],"and":[10,47,83,96,220],"fraction":[12,28],"f":[13,29,44],"in":[14,25,77,107,116,131,224,236,245,250],"(1/2,1],":[15],"frequent":[17,191],"subtree":[18,22,38,113,128,203],"(FST)":[19],"is":[20,114,170,196,200,212,221,257],"isomorphically":[23],"included":[24,115,130],"at":[26],"least":[27],"the":[31,49,60,91,122,133,139,165,176,208,229,260],"input":[32,123,134],"trees.":[33,240],"The":[34,254],"well-known":[35],"maximum":[36,140],"agreement":[37],"(MAST)":[39],"problem":[40,93,231],"identifies":[41],"FST":[42,198],"with":[43],"=":[45],"1":[46],"having":[48,153],"largest":[50],"number":[51,141,177],"leaves.":[53,143],"Apart":[54],"from":[55,59,181],"its":[56,243],"intrinsic":[57],"interest":[58],"algorithmic":[61],"perspective,":[62],"MAST":[63,92,157],"has":[64],"practical":[65],"applications":[66],"as":[67,84],"metric":[69],"for":[70,73],"tree":[71,75],"similarity,":[72],"computing":[74],"congruence,":[76],"detection":[78],"horizontal":[79],"gene":[80],"transfer":[81],"events":[82],"consensus":[86,248],"approach.":[87],"Enumerating":[88],"FSTs":[89,145,179,219],"extend":[90],"by":[94,102],"denition":[95],"reveal":[97],"additional":[98],"subtrees":[99,192],"not":[100,119,137,159,201],"displayed":[101],"MAST.":[103,253],"This":[104],"can":[105,146],"happen":[106],"tow":[108],"ways":[109],"-":[110,184],"such":[111,126],"majority":[117],"but":[118],"all":[120,132,218,234],"or":[125],"though":[129],"trees,":[135],"does":[136],"have":[138],"Further,":[144],"be":[147,160],"enumerated":[148],"o":[151],"ftrees":[152],"partially":[154],"overlapping":[155],"leafsets.":[156],"may":[158],"useful":[161],"here":[162],"especially":[163],"if":[164],"overlap":[167],"among":[168],"leafsets":[169],"very":[171,174],"low.":[172],"Though":[173],"useful,":[175],"suffer":[180],"combinatorial":[182],"explosion":[183],"just":[185],"single":[187],"enumeration":[188],"maximal":[190],"(MFSTs).":[193],"A":[194],"MFST":[195],"that":[199],"to":[204,252],"any":[205],"othe":[206],"rFST.":[207],"set":[209],"MFSTs":[211,235],"compact":[214],"non-redundant":[215],"summary":[216],"much":[222],"smaller":[223],"size.":[225],"Here":[226],"we":[227],"tackle":[228],"novel":[230],"enumerating":[233],"collections":[237],"phylogenetic":[239],"We":[241],"demonstrate":[242],"utility":[244],"returning":[246],"larger":[247],"comparison":[251],"current":[255],"implementation":[256],"available":[258],"web.":[261]},"counts_by_year":[],"updated_date":"2026-08-30T07:30:35.949966","created_date":"2016-06-24T00:00:00"}