{"id":"https://openalex.org/W6887873407","doi":"https://doi.org/10.17877/de290r-22479","title":"Tree comparison: enumeration and application to cheminformatics","display_name":"Tree comparison: enumeration and application to cheminformatics","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W6887873407","doi":"https://doi.org/10.17877/de290r-22479"},"language":"en","primary_location":{"id":"doi:10.17877/de290r-22479","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-22479","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17877/de290r-22479","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Droschinsky, Andre","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Droschinsky, Andre","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23184641,"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":true,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.2117999941110611,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.2117999941110611,"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"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.1264999955892563,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.08730000257492065,"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/generalization","display_name":"Generalization","score":0.6685000061988831},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5863000154495239},{"id":"https://openalex.org/keywords/cheminformatics","display_name":"Cheminformatics","score":0.5473999977111816},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.515999972820282},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4862000048160553},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.39809998869895935}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6685000061988831},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5863000154495239},{"id":"https://openalex.org/C68762167","wikidata":"https://www.wikidata.org/wiki/Q910164","display_name":"Cheminformatics","level":2,"score":0.5473999977111816},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.515999972820282},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47839999198913574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47589999437332153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.474700003862381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45820000767707825},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.39809998869895935},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.38429999351501465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34139999747276306},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3312000036239624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31929999589920044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.295199990272522},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2590000033378601}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.17877/de290r-22479","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-22479","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.17877/de290r-22479","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-22479","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graphs":[0],"are":[1,19,47,56,70,93,120],"a":[2,133,166,187,213,222,296,319,377,400,422],"well-known":[3],"data":[4,84],"structure":[5],"used":[6],"in":[7,27,203,309,326,372,391],"many":[8],"application":[9,143,247],"domains":[10],"that":[11,85,119,182],"rely":[12],"on":[13,180],"relationships":[14],"between":[15,68,238,356,380,430,435],"individual":[16],"entities.":[17],"Examples":[18],"social":[20],"networks,":[21,33],"where":[22,34,45,62,433],"the":[23,75,107,112,127,137,158,193,205,225,230,246,251,264,268,272,285,300,310,330,342,348,366,381,395,447,452,466],"users":[24],"may":[25,408],"be":[26,87,409,441],"friendship":[28],"with":[29,186],"each":[30],"other,":[31],"road":[32],"one-way":[35],"or":[36,277,411],"bidirectional":[37],"roads":[38],"connect":[39],"crossings,":[40],"and":[41,53,66,262,271,347,383,438,451],"work":[42],"package":[43],"assignments,":[44],"workers":[46],"assigned":[48],"to":[49,95,102,122,172,248,267,274,332,398],"tasks.":[50],"In":[51,153],"chem-":[52],"bioinformatics,":[54],"molecules":[55],"often":[57],"represented":[58,71],"as":[59,89,257,292],"molecular":[60,150,258],"graphs,":[61,90,432],"vertices":[63,308,382,437],"represent":[64],"atoms,":[65],"bonds":[67],"them":[69],"by":[72,245],"edges":[73,384,439],"connecting":[74],"vertices.":[76],"Since":[77,318],"there":[78],"is":[79,106,144,170,192,243,260,323,365,397,425],"an":[80],"ever-increasing":[81],"amount":[82],"of":[83,174,197,224,254,299,368,403,419,454,465],"can":[86,131],"treated":[88],"fast":[91],"algorithms":[92,185],"needed":[94],"compare":[96,103],"such":[97,421],"graphs.":[98,125,177,240,358,374],"A":[99,141,416],"well-researched":[100],"concept":[101],"two":[104,175,198],"graphs":[105,259],"maximum":[108,138,159,194,226,233,301,320,335,343,351,369,404,458],"common":[109,121,139,160,195,227,234,283,302,321,344,352,388,401,427,459],"subgraph.":[110,140],"On":[111,126],"one":[113],"hand,":[114,129],"this":[115,154,339,392],"allows":[116,306],"\ufb01nding":[117,165],"substructures":[118],"both":[123,341],"input":[124,176,199,311],"other":[128],"we":[130,156,211,280,328,363],"derive":[132],"similarity":[134,151],"score":[135],"from":[136],"practical":[142,448],"rational":[145],"drug":[146],"design":[147],"which":[148,163,169,305,362],"involves":[149],"searches.":[152],"thesis,":[155],"study":[157,221,445],"subgraph":[161,236,322,354,389,402,428,461],"problem,":[162,229,304],"entails":[164],"largest":[167],"graph,":[168],"isomorphic":[171],"subgraphs":[173],"We":[178,201,220,294,337,375],"focus":[179],"restrictions":[181],"allow":[183,281],"polynomial-time":[184],"low":[188],"exponent.":[189],"An":[190,359,443],"example":[191],"subtree":[196,228,303,345],"trees.":[200],"succeed":[202],"improving":[204],"previously":[206],"best-known":[207],"time":[208,215],"bound.":[209],"Additionally,":[210],"provide":[212],"lower":[214],"bound":[216],"under":[217],"certain":[218],"assumptions.":[219],"generalization":[223,298],"block-and-bridge":[231,349,456],"preserving":[232,350,457],"induced":[235,353,460],"problem":[237,242,286,331,346,355],"outerplanar":[239,357],"This":[241],"motivated":[244],"cheminformatics.":[249],"First,":[250],"vast":[252],"majority":[253],"drugs":[255],"modeled":[256],"outerplanar,":[261],"second,":[263],"blocks":[265],"correspond":[266],"ring":[269],"structures":[270],"bridges":[273],"atom":[275],"chains":[276],"linkers.":[278],"If":[279],"disconnected":[282],"subgraphs,":[284],"becomes":[287],"NP-hard":[288],"even":[289],"for":[290,340,385],"trees":[291,312],"input.":[293],"propose":[295],"second":[297],"skipping":[307],"while":[313],"maintaining":[314],"polynomial":[315],"running":[316,449],"time.":[317],"not":[324],"unique":[325],"general,":[327],"investigate":[329],"enumerate":[333],"all":[334,386],"solutions.":[336],"do":[338],"arising":[360],"subproblem":[361],"analyze":[364],"enumeration":[367],"weight":[370,378,423],"matchings":[371],"bipartite":[373],"support":[376],"function":[379,424],"proposed":[387],"methods":[390],"thesis.":[393],"Thus":[394],"objective":[396],"compute":[399],"weight.":[405],"The":[406],"weights":[407],"integral":[410],"real-valued,":[412],"including":[413],"negative":[414],"values.":[415],"special":[417],"case":[418],"using":[420],"computing":[426],"isomorphisms":[429],"labeled":[431],"labels":[434],"mapped":[436],"must":[440],"equal.":[442],"experimental":[444],"evaluates":[446],"times":[450],"usefulness":[453],"our":[455],"algorithm":[462],"against":[463],"state":[464],"art":[467],"algorithms.":[468]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}