{"id":"https://openalex.org/W4414695025","doi":"https://doi.org/10.48550/arxiv.2509.15409","title":"FragmentRetro: A Quadratic Retrosynthetic Method Based on Fragmentation Algorithms","display_name":"FragmentRetro: A Quadratic Retrosynthetic Method Based on Fragmentation Algorithms","publication_year":2025,"publication_date":"2025-09-18","ids":{"openalex":"https://openalex.org/W4414695025","doi":"https://doi.org/10.48550/arxiv.2509.15409"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.15409","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.15409","pdf_url":"https://arxiv.org/pdf/2509.15409","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.15409","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032771309","display_name":"Yu Shee","orcid":"https://orcid.org/0000-0002-3728-0021"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shee, Yu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092065223","display_name":"Anthony M. Smaldone","orcid":"https://orcid.org/0009-0008-7265-0017"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Smaldone, Anthony M.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075906555","display_name":"Anton Morgunov","orcid":"https://orcid.org/0009-0004-6245-0354"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morgunov, Anton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064756306","display_name":"Gregory W. Kyro","orcid":"https://orcid.org/0000-0002-0095-8548"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kyro, Gregory W.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089129603","display_name":"V\u00edctor S. Batista","orcid":"https://orcid.org/0000-0002-3262-1237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Batista, Victor S.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5032771309"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T11986","display_name":"Scientific Computing and Data Management","score":0.06790000200271606,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11986","display_name":"Scientific Computing and Data Management","score":0.06790000200271606,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.06270000338554382,"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/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.05959999933838844,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/retrosynthetic-analysis","display_name":"Retrosynthetic analysis","score":0.769599974155426},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5949000120162964},{"id":"https://openalex.org/keywords/fragmentation","display_name":"Fragmentation (computing)","score":0.545799970626831},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5311999917030334},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.504800021648407},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.476500004529953},{"id":"https://openalex.org/keywords/substructure","display_name":"Substructure","score":0.4684000015258789},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.46050000190734863},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4431000053882599}],"concepts":[{"id":"https://openalex.org/C42437451","wikidata":"https://www.wikidata.org/wiki/Q902227","display_name":"Retrosynthetic analysis","level":3,"score":0.769599974155426},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5949000120162964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5615000128746033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5565000176429749},{"id":"https://openalex.org/C191015642","wikidata":"https://www.wikidata.org/wiki/Q1132459","display_name":"Fragmentation (computing)","level":2,"score":0.545799970626831},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5311999917030334},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.504800021648407},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.476500004529953},{"id":"https://openalex.org/C99679407","wikidata":"https://www.wikidata.org/wiki/Q56761637","display_name":"Substructure","level":2,"score":0.4684000015258789},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.46050000190734863},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4431000053882599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.424699991941452},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.413100004196167},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4104999899864197},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4007999897003174},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39590001106262207},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3440999984741211},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3174000084400177},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.15409","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.15409","pdf_url":"https://arxiv.org/pdf/2509.15409","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.15409","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.15409","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.15409","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.15409","pdf_url":"https://arxiv.org/pdf/2509.15409","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"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":{"Retrosynthesis,":[0],"the":[1,82,109,115,121],"process":[2],"of":[3,74,87,111],"deconstructing":[4],"a":[5,34,68,188],"target":[6,116],"molecule":[7,117],"into":[8],"simpler":[9],"precursors,":[10],"is":[11,120],"crucial":[12],"for":[13,124,192],"computer-aided":[14],"synthesis":[15,196],"planning":[16],"(CASP).":[17],"Widely":[18],"adopted":[19],"tree-search":[20],"methods":[21],"often":[22],"suffer":[23],"from":[24,153],"exponential":[25,95],"computational":[26,85,176],"complexity.":[27,57,161],"In":[28],"this":[29],"work,":[30],"we":[31],"introduce":[32],"FragmentRetro,":[33],"novel":[35],"retrosynthetic":[36,78,88],"method":[37,151],"that":[38,91,135],"leverages":[39],"fragmentation":[40],"algorithms,":[41],"specifically":[42],"BRICS":[43],"and":[44,50,63,102,118,131,178,194],"r-BRICS,":[45],"combined":[46],"with":[47,141],"stock-aware":[48],"exploration":[49],"pattern":[51],"fingerprint":[52,154],"screening":[53],"to":[54,180],"achieve":[55],"quadratic":[56],"FragmentRetro":[58,103,136,163],"recursively":[59],"combines":[60],"molecular":[61],"fragments":[62],"verifies":[64],"their":[65],"presence":[66],"in":[67,114],"building":[69],"block":[70],"set,":[71],"providing":[72],"sets":[73],"fragment":[75],"combinations":[76],"as":[77,100,187],"solutions.":[79],"We":[80],"present":[81],"first":[83],"formal":[84],"analysis":[86],"methods,":[89],"showing":[90],"tree":[92,125,147],"search":[93,148],"exhibits":[94],"complexity":[96],"$O(b^h)$,":[97],"DirectMultiStep":[98],"scales":[99],"$O(h^6)$,":[101],"achieves":[104,137],"$O(h^2)$,":[105],"where":[106,146],"$h$":[107],"represents":[108],"number":[110],"heavy":[112],"atoms":[113],"$b$":[119],"branching":[122],"factor":[123],"search.":[126],"Evaluations":[127],"on":[128,165],"PaRoutes,":[129],"USPTO-190,":[130],"natural":[132],"products":[133],"demonstrate":[134],"high":[138],"solved":[139],"rates":[140],"competitive":[142],"runtime,":[143],"including":[144],"cases":[145],"fails.":[149],"The":[150],"benefits":[152],"screening,":[155],"which":[156],"significantly":[157],"reduces":[158],"substructure":[159],"matching":[160],"While":[162],"focuses":[164],"efficiently":[166],"identifying":[167],"fragment-based":[168],"solutions":[169],"rather":[170],"than":[171],"full":[172],"reaction":[173],"pathways,":[174],"its":[175],"advantages":[177],"ability":[179],"generate":[181],"strategic":[182],"starting":[183],"candidates":[184],"establish":[185],"it":[186],"powerful":[189],"foundational":[190],"component":[191],"scalable":[193],"automated":[195],"planning.":[197]},"counts_by_year":[],"updated_date":"2026-05-31T08:46:17.908082","created_date":"2025-10-10T00:00:00"}