{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:24Z","timestamp":1750219764889,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T00:00:00Z","timestamp":1666310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Natural Science Foundation of Shandong Province","award":["ZR2018MF012"],"award-info":[{"award-number":["ZR2018MF012"]}]},{"name":"the National Natural Science Foundation of China","award":["61902221"],"award-info":[{"award-number":["61902221"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,21]]},"DOI":"10.1145\/3565387.3565407","type":"proceedings-article","created":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T01:47:11Z","timestamp":1670982431000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial Time Algorithm for a Class of Two-Sided Scaffold Filling Base Contig"],"prefix":"10.1145","author":[{"given":"Nan","family":"Liu","sequence":"first","affiliation":[{"name":"Shandong Jianzhu University of Computer Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenghua","family":"Li","sequence":"additional","affiliation":[{"name":"Shandong Jianzhu University of Computer Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongqi","family":"Zhu","sequence":"additional","affiliation":[{"name":"Shandong Jianzhu University of Computer Science and Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-11-304"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.57"},{"key":"e_1_3_2_1_3_1","volume-title":"Filling scaffolds with gene repetitions: maximizing the number of adjacencies[C] \/\/Combinatorial Pattern Matching - 22nd Annual Symposium","author":"Jiang H T","year":"2011","unstructured":"Jiang H T , Zhong F R , Zhu B H . Filling scaffolds with gene repetitions: maximizing the number of adjacencies[C] \/\/Combinatorial Pattern Matching - 22nd Annual Symposium . Heidelberg : Springer Verlag , 2011 : 55-64. Jiang H T, Zhong F R, Zhu B H. Filling scaffolds with gene repetitions: maximizing the number of adjacencies[C] \/\/Combinatorial Pattern Matching - 22nd Annual Symposium. Heidelberg: Springer Verlag, 2011: 55-64."},{"key":"e_1_3_2_1_4_1","volume-title":"Notes on the 6\/5-Approximation Algorithm for One-Sided Scaffold Filling[C]\/\/10th International Workshop on Frontiers in Algorithmics","author":"Ma J J","year":"2016","unstructured":"Ma J J , Jiang H T . Notes on the 6\/5-Approximation Algorithm for One-Sided Scaffold Filling[C]\/\/10th International Workshop on Frontiers in Algorithmics . Heidelberg : Springer Verlag , 2016 : 145-157. Ma J J, Jiang H T. Notes on the 6\/5-Approximation Algorithm for One-Sided Scaffold Filling[C]\/\/10th International Workshop on Frontiers in Algorithmics. Heidelberg: Springer Verlag, 2016: 145-157."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2013.100"},{"key":"e_1_3_2_1_6_1","first-page":"251","article-title":"Approximation and nonapproximability for the one-sided scaffold filling problem[C]\/\/21st International Conference on Computing and Combinatorics Conference vol. Heidelberg","volume":"2015","author":"Jiang H T","unstructured":"Jiang H T , Ma J J , Luan J F , Approximation and nonapproximability for the one-sided scaffold filling problem[C]\/\/21st International Conference on Computing and Combinatorics Conference vol. Heidelberg : Springer Verlag , 2015 : 251 \u2013 263 .) Jiang H T, Ma J J, Luan J F, Approximation and nonapproximability for the one-sided scaffold filling problem[C]\/\/21st International Conference on Computing and Combinatorics Conference vol. Heidelberg: Springer Verlag, 2015: 251\u2013263.)","journal-title":"Springer Verlag"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00175"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9938-9"},{"key":"e_1_3_2_1_9_1","first-page":"196","volume":"2017","author":"Ma J","unstructured":"Ma J , Jiang H , Zhu D , A 1.4- Approximation Algorithm for Two-Sided Scaffold Filling[C] . Frontiers in Algorithmics , 2017 : 196 - 208 . Ma J, Jiang H, Zhu D, A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling[C]. Frontiers in Algorithmics, 2017: 196-208.","journal-title":"Frontiers in Algorithmics"},{"key":"e_1_3_2_1_10_1","volume-title":"The Algorithm for the Two-Sided Scaffold Filling Problem[J]","author":"Nan L","year":"2013","unstructured":"Nan L , Zhu D. The Algorithm for the Two-Sided Scaffold Filling Problem[J] . Springer , Berlin, Heidelberg , 2013 . Nan L, Zhu D. The Algorithm for the Two-Sided Scaffold Filling Problem[J]. Springer, Berlin, Heidelberg, 2013."},{"key":"e_1_3_2_1_11_1","first-page":"873","author":"Ma J","year":"2021","unstructured":"Ma J , Zhu D , Jiang H , On the Solution Bound of Two-Sided Scaffold Filling[J] . Theoretical Computer Science , 2021 , 873 . Ma J, Zhu D, Jiang H, On the Solution Bound of Two-Sided Scaffold Filling[J]. Theoretical Computer Science, 2021, 873.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_12_1","unstructured":"http:\/\/wgs-assembler.sourceforge.net\/  http:\/\/wgs-assembler.sourceforge.net\/"},{"key":"e_1_3_2_1_13_1","first-page":"95","volume":"2019","author":"Feng Q","unstructured":"Feng Q , Meng X , Tan G , A 2.57- Approximation Algorithm for Contig-Based Genomic Scaffold Filling[C] . Algorithmic Aspects in Information and Management , 2019 : 95 - 107 . Feng Q, Meng X, Tan G, A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling[C]. Algorithmic Aspects in Information and Management, 2019: 95-107.","journal-title":"Algorithmic Aspects in Information and Management"},{"key":"e_1_3_2_1_14_1","first-page":"85","article-title":"Algorithm for a Class of Contig-Based Two-Sided Scaffold Filling,2020 2nd International Conference on Video","volume":"2020","author":"Chunliang L","unstructured":"Chunliang L , Qinye X , Handong J, A Polynomial Time Algorithm for a Class of Contig-Based Two-Sided Scaffold Filling,2020 2nd International Conference on Video , Signal and Image Processing: Association for Computing Machinery , 2020 : 85 \u2013 90 . Chunliang L, Qinye X, Handong J, A Polynomial Time Algorithm for a Class of Contig-Based Two-Sided Scaffold Filling,2020 2nd International Conference on Video, Signal and Image Processing: Association for Computing Machinery, 2020: 85\u201390.","journal-title":"Signal and Image Processing: Association for Computing Machinery"},{"volume-title":"Research progress of two sequence alignment algorithms and software[J]. Computer applications and software","year":"2015","key":"e_1_3_2_1_15_1","unstructured":"JIAO Y, GAO J, ZHANG W G. Research progress of two sequence alignment algorithms and software[J]. Computer applications and software , 2015 , 32(06):5-8+13 JIAO Y, GAO J, ZHANG W G. Research progress of two sequence alignment algorithms and software[J]. Computer applications and software, 2015, 32(06):5-8+13"}],"event":{"name":"CSAE 2022: The 6th International Conference on Computer Science and Application Engineering","acronym":"CSAE 2022","location":"Virtual Event China"},"container-title":["The 6th International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565387.3565407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565387.3565407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:13Z","timestamp":1750178233000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565387.3565407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,21]]},"references-count":15,"alternative-id":["10.1145\/3565387.3565407","10.1145\/3565387"],"URL":"https:\/\/doi.org\/10.1145\/3565387.3565407","relation":{},"subject":[],"published":{"date-parts":[[2022,10,21]]}}}