{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:27Z","timestamp":1750219827038,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T00:00:00Z","timestamp":1693699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2019797","2145171"],"award-info":[{"award-number":["2019797","2145171"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"NIH (National Institutes of Health)","doi-asserted-by":"publisher","award":["R01HG011065"],"award-info":[{"award-number":["R01HG011065"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,9,3]]},"DOI":"10.1145\/3584371.3612982","type":"proceedings-article","created":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T18:52:30Z","timestamp":1696445550000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Maximal Independent Sets of\n            <i>k<\/i>\n            -mers with the Edit Distance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-2061","authenticated-orcid":false,"given":"Leran","family":"Ma","sequence":"first","affiliation":[{"name":"Schreyer Honors College, The Pennsylvania State University, State College, Pennsylvania, USA"},{"name":"Department of Computer Science and Engineering, The Pennsylvania State University, State College, Pennsylvania, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5470-6621","authenticated-orcid":false,"given":"Ke","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Pennsylvania State University, State College, Pennsylvania, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6112-5139","authenticated-orcid":false,"given":"Mingfu","family":"Shao","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Pennsylvania State University, State College, Pennsylvania, USA"},{"name":"Huck Institutes of the Life Sciences, The Pennsylvania State University, State College, Pennsylvania, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00027"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3291525"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1993.341106"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035939"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts635"},{"key":"e_1_3_2_1_6_1","volume-title":"Dynamic Approximate Maximum Independent Set on Massive Graphs. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE","author":"Gao Xiangyu","year":"2022","unstructured":"Xiangyu Gao , Jianzhong Li , and Dongjing Miao . 2022 . Dynamic Approximate Maximum Independent Set on Massive Graphs. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE , 1835--1847. Xiangyu Gao, Jianzhong Li, and Dongjing Miao. 2022. Dynamic Approximate Maximum Independent Set on Massive Graphs. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1835--1847."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.11.031"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1101\/2022.01.11.475838"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4060"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-017-1881-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41588-018-0207-8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/060660126"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.12"},{"key":"e_1_3_2_1_14_1","volume-title":"Soviet Physics Doklady","volume":"10","author":"Vladimir","unstructured":"Vladimir I Levenshtein et al. 1966. Binary codes capable of correcting deletions, insertions, and reversals . In Soviet Physics Doklady , Vol. 10 , no. 8. Soviet Union, 707--710. Vladimir I Levenshtein et al. 1966. Binary codes capable of correcting deletions, insertions, and reversals. In Soviet Physics Doklady, Vol. 10, no. 8. Soviet Union, 707--710."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty191"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831363"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.440"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl263"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw397"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284322"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2019.0298"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.gpb.2015.08.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10032-002-0082-8"}],"event":{"name":"BCB '23: 14th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Houston TX USA","acronym":"BCB '23"},"container-title":["Proceedings of the 14th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584371.3612982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584371.3612982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:26Z","timestamp":1750178786000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584371.3612982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,3]]},"references-count":23,"alternative-id":["10.1145\/3584371.3612982","10.1145\/3584371"],"URL":"https:\/\/doi.org\/10.1145\/3584371.3612982","relation":{},"subject":[],"published":{"date-parts":[[2023,9,3]]},"assertion":[{"value":"2023-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}