{"id":"https://openalex.org/W7104523117","doi":"https://doi.org/10.1145/3747199.3747571","title":"An Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks","display_name":"An Efficient Algorithm for Determining the Equivalence of Zero-one Reaction Networks","publication_year":2025,"publication_date":"2025-07-28","ids":{"openalex":"https://openalex.org/W7104523117","doi":"https://doi.org/10.1145/3747199.3747571"},"language":null,"primary_location":{"id":"doi:10.1145/3747199.3747571","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3747199.3747571","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","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":null,"display_name":"Yue Jiao","orcid":"https://orcid.org/0009-0002-2463-8829"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yue Jiao","raw_affiliation_strings":["Beihang University, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0002-2463-8829","affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":null,"display_name":"Xiaoxian Tang","orcid":"https://orcid.org/0000-0002-9873-7056"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoxian Tang","raw_affiliation_strings":["Beihang University, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-9873-7056","affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":1.3257,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87666029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.22169999778270721,"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"}},"topics":[{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.22169999778270721,"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"}},{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.1590999960899353,"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/T10142","display_name":"Formal Methods in Verification","score":0.061000000685453415,"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/equivalence","display_name":"Equivalence (formal languages)","score":0.8205000162124634},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.5152999758720398},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.3749000132083893},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2418999969959259}],"concepts":[{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.8205000162124634},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.5152999758720398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44920000433921814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44519999623298645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39309999346733093},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3206999897956848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3059999942779541},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2418999969959259},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.23589999973773956}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3747199.3747571","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3747199.3747571","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4504232704639435,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2006392548","https://openalex.org/W2043653908","https://openalex.org/W2128687423","https://openalex.org/W2516653421","https://openalex.org/W2962993948","https://openalex.org/W2963021707","https://openalex.org/W2964290173","https://openalex.org/W2979031721","https://openalex.org/W4225262848","https://openalex.org/W4250501683","https://openalex.org/W4362671348","https://openalex.org/W4385236238","https://openalex.org/W4385951804","https://openalex.org/W4390503227","https://openalex.org/W4401634851","https://openalex.org/W4403925060"],"related_works":[],"abstract_inverted_index":{"Zero-one":[0],"reaction":[1,14,26],"networks":[2,15,83],"play":[3],"a":[4,17,89],"crucial":[5],"role":[6],"in":[7,21,88],"cell":[8],"signaling.":[9],"Determining":[10],"the":[11,22,38,51,54,66],"equivalence":[12,39,52,87],"of":[13,24,40,53],"is":[16],"fundamental":[18],"computational":[19],"problem":[20],"field":[23],"chemical":[25],"networks.":[27,42],"In":[28],"this":[29],"work,":[30],"we":[31],"develop":[32],"an":[33],"efficient":[34],"method":[35,76],"for":[36,49,63],"determining":[37,50],"zero-one":[41,59],"The":[43],"efficiency":[44],"comes":[45],"from":[46,58],"several":[47],"criteria":[48],"steady-state":[55],"ideals":[56],"arising":[57],"networks,":[60],"which":[61],"helps":[62],"cutting":[64],"down":[65],"expenses":[67],"on":[68],"computing":[69],"Gr\u00f6bner":[70],"bases.":[71],"Experiments":[72],"show":[73],"that":[74],"our":[75],"can":[77],"successfully":[78],"classify":[79],"over":[80],"three":[81],"million":[82],"according":[84],"to":[85],"their":[86],"reasonable":[90],"time.":[91]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-10T23:18:03.357015","created_date":"2025-11-10T00:00:00"}