{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:30Z","timestamp":1750307910354,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,11]],"date-time":"2007-03-11T00:00:00Z","timestamp":1173571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,3,11]]},"DOI":"10.1145\/1244002.1244030","type":"proceedings-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:31Z","timestamp":1181140651000},"page":"113-117","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical alignment graph for gene teams finding on whole genomes"],"prefix":"10.1145","author":[{"given":"Hee-Jeong","family":"Jin","sequence":"first","affiliation":[{"name":"Pusan National University, Jangjeon-dong, Keumjeong-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hwan-Gue","family":"Cho","sequence":"additional","affiliation":[{"name":"Pusan National University, Jangjeon-dong, Keumjeong-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645907.673120"},{"volume-title":"Psychometrika","year":"1967","author":"J. S.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/974614.974650"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"S.\n       \n      Heber\n     and \n      \n      \n      J.\n       \n      Stoye\n      \n  \n  . \n  Finding all common intervals of k permutations. Proceedings of CPM 01 volume \n  2089\n   of \n  Lecture Notes in Computer Science pages \n  207\n  --\n  218 2001\n  .   S. Heber and J. Stoye. Finding all common intervals of k permutations. Proceedings of CPM 01 volume 2089 of Lecture Notes in Computer Science pages 207--218 2001.","DOI":"10.1007\/3-540-48194-X_19"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2005.33"},{"journal-title":"Journal of Computational Biology","year":"2005","author":"Landau G. M.","key":"e_1_3_2_1_6_1"},{"volume-title":"Proc. the National Academy of Sciences USA","year":"1999","author":"Overbeek R.","key":"e_1_3_2_1_7_1"},{"journal-title":"Journal of Biology","year":"2002","author":"Spellman P. T.","key":"e_1_3_2_1_8_1"}],"event":{"name":"SAC07: The 2007 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Seoul Korea","acronym":"SAC07"},"container-title":["Proceedings of the 2007 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244030","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1244002.1244030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:49Z","timestamp":1750258069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1244002.1244030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,11]]},"references-count":8,"alternative-id":["10.1145\/1244002.1244030","10.1145\/1244002"],"URL":"https:\/\/doi.org\/10.1145\/1244002.1244030","relation":{},"subject":[],"published":{"date-parts":[[2007,3,11]]},"assertion":[{"value":"2007-03-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}