{"id":"https://openalex.org/W2041448601","doi":"https://doi.org/10.1145/2245276.2232001","title":"Tree-based search for stochastic simulation algorithm","display_name":"Tree-based search for stochastic simulation algorithm","publication_year":2012,"publication_date":"2012-03-26","ids":{"openalex":"https://openalex.org/W2041448601","doi":"https://doi.org/10.1145/2245276.2232001","mag":"2041448601"},"language":"en","primary_location":{"id":"doi:10.1145/2245276.2232001","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2245276.2232001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th Annual ACM Symposium on Applied Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11572/359692","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014591008","display_name":"Vo Hong Thanh","orcid":"https://orcid.org/0000-0003-4599-0215"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Vo Hong Thanh","raw_affiliation_strings":["University of Trento, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003560156","display_name":"Roberto Zunino","orcid":"https://orcid.org/0000-0002-9630-429X"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Zunino","raw_affiliation_strings":["University of Trento, Italy and COSBI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Trento, Italy and COSBI","institution_ids":["https://openalex.org/I193223587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6719,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.68307361,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1415","last_page":"1416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9995999932289124,"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/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9995999932289124,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.8543197512626648},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.8462759852409363},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.7472695708274841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6920563578605652},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.6744465827941895},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6735751032829285},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.6491638422012329},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6192021369934082},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6153092980384827},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.6114934086799622},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5811322331428528},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5555319786071777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5393438339233398},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5140072107315063},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.45341265201568604},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.42026475071907043},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41419732570648193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3714674413204193},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.31380489468574524},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.30590546131134033},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2484104335308075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22318404912948608}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8543197512626648},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.8462759852409363},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.7472695708274841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6920563578605652},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.6744465827941895},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6735751032829285},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.6491638422012329},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6192021369934082},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6153092980384827},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.6114934086799622},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5811322331428528},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5555319786071777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5393438339233398},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5140072107315063},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.45341265201568604},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.42026475071907043},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41419732570648193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3714674413204193},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.31380489468574524},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.30590546131134033},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2484104335308075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22318404912948608},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2245276.2232001","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2245276.2232001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th Annual ACM Symposium on Applied Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.biblio.unitn.it:2273","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400311","display_name":"Unitn Eprints Research (Universit\u00e0 Degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Departmental Technical Report"},{"id":"pmh:oai:iris.unitn.it:11572/359692","is_oa":true,"landing_page_url":"https://hdl.handle.net/11572/359692","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:iris.unitn.it:11572/89040","is_oa":false,"landing_page_url":"http://hdl.handle.net/11572/89040","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"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":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unitn.it:11572/359692","is_oa":true,"landing_page_url":"https://hdl.handle.net/11572/359692","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1974272479","https://openalex.org/W1997656209","https://openalex.org/W2011432832","https://openalex.org/W2042321087","https://openalex.org/W2044692345","https://openalex.org/W2044859335","https://openalex.org/W2052257784","https://openalex.org/W2060108852","https://openalex.org/W2065162426","https://openalex.org/W2072077152","https://openalex.org/W2078734278","https://openalex.org/W2084924279","https://openalex.org/W2090248212","https://openalex.org/W2108493072","https://openalex.org/W2119272407","https://openalex.org/W2152828142","https://openalex.org/W2155418451","https://openalex.org/W2166606713","https://openalex.org/W2167154952"],"related_works":["https://openalex.org/W4244673516","https://openalex.org/W2022598760","https://openalex.org/W2061004850","https://openalex.org/W3109340025","https://openalex.org/W2107381954","https://openalex.org/W2074513192","https://openalex.org/W2955615582","https://openalex.org/W2280371997","https://openalex.org/W2095570436","https://openalex.org/W2132255384"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"an":[5,43],"efficient":[6],"tree-based":[7],"formulation":[8],"for":[9,19,46],"exact":[10],"stochastic":[11],"simulation":[12],"algorithm":[13],"(SSA)":[14],"to":[15],"improve":[16],"the":[17,20,40],"search":[18],"next":[21],"reaction":[22],"firing.":[23],"There":[24],"are":[25],"two":[26],"implementations":[27],"considered:":[28],"one":[29,37],"based":[30,38],"on":[31,39],"a":[32],"complete":[33],"binary":[34],"tree":[35,45],"and":[36],"Huffman":[41],"tree,":[42],"optimal":[44],"data":[47],"compression.":[48]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}