{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:55Z","timestamp":1750307455071,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T00:00:00Z","timestamp":1280707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100005714","name":"Office of Experimental Program to Stimulate Competitive Research","doi-asserted-by":"publisher","award":["EPS-0091900"],"award-info":[{"award-number":["EPS-0091900"]}],"id":[{"id":"10.13039\/100005714","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["EIA-0091530"],"award-info":[{"award-number":["EIA-0091530"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,8,2]]},"DOI":"10.1145\/1854776.1854818","type":"proceedings-article","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T15:48:28Z","timestamp":1283874508000},"page":"302-311","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The solution space of genome sequence alignment and LIS graph decomposition"],"prefix":"10.1145","author":[{"given":"Fangrui","family":"Ma","sequence":"first","affiliation":[{"name":"University of Nebraska-Lincoln, Lincoln, NE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jitender S.","family":"Deogun","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln, Lincoln, NE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,8,2]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/645907.673271"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/S0022-2836(05)80360-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1101\/gr.926603"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/792771.793868"},{"key":"e_1_3_2_1_5_1","volume-title":"Jul","author":"Brudno M.","year":"2004","unstructured":"M. Brudno , R. Steinkamp , and B. Morgenstern . The CHAOS\/DIALIGN WWW server for multiple alignment of genomic sequences. Nucleic Acids Res, 32(Web Server issue):W41--W44 , Jul 2004 . M. Brudno, R. Steinkamp, and B. Morgenstern. The CHAOS\/DIALIGN WWW server for multiple alignment of genomic sequences. Nucleic Acids Res, 32(Web Server issue):W41--W44, Jul 2004."},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . The MIT Press , second edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, second edition, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1101\/gr.2289704"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-1-59745-515-2_10"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1006\/jagm.2001.1199"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1093\/nar\/27.11.2369"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1093\/nar\/30.11.2478"},{"key":"e_1_3_2_1_12_1","first-page":"113","volume-title":"APBC","author":"Deogun J. S.","year":"2004","unstructured":"J. S. Deogun , J. Yang , and F. Ma . EMAGEN: An efficient approach to multiple whole genome alignment . In APBC , pages 113 -- 122 , 2004 . J. S. Deogun, J. Yang, and F. Ma. EMAGEN: An efficient approach to multiple whole genome alignment. In APBC, pages 113--122, 2004."},{"key":"e_1_3_2_1_13_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2000","unstructured":"R. Diestel . Graph Theory . Springer , 2 nd edition, 2000 . R. Diestel. Graph Theory. Springer, 2nd edition, 2000.","edition":"2"},{"key":"e_1_3_2_1_14_1","volume-title":"Algorithms on strings, trees, and sequences","author":"Gusfield D.","year":"1999","unstructured":"D. Gusfield . Algorithms on strings, trees, and sequences . Cambridge University Press , 1999 . D. Gusfield. Algorithms on strings, trees, and sequences. Cambridge University Press, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1186\/gb-2004-5-2-r12"},{"key":"e_1_3_2_1_17_1","volume-title":"improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15:211--218","author":"Morgenstern B.","year":"1999","unstructured":"B. Morgenstern . DIALIGN 2 : improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15:211--218 , 1999 . B. Morgenstern. DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics, 15:211--218, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1093\/bioinformatics\/14.3.290"},{"key":"e_1_3_2_1_19_1","first-page":"185","article-title":"Flexible sequence similarity searching with the FASTA3 program package","volume":"132","author":"Pearson W. R.","year":"2000","unstructured":"W. R. Pearson . Flexible sequence similarity searching with the FASTA3 program package . Methods Mol Biol , 132 : 185 -- 219 , 2000 . W. R. Pearson. Flexible sequence similarity searching with the FASTA3 program package. Methods Mol Biol, 132:185--219, 2000.","journal-title":"Methods Mol Biol"}],"event":{"sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"acronym":"BCB'10","name":"BCB'10: ACM International Conference on Bioinformatics and Computational Biology","location":"Niagara Falls New York"},"container-title":["Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1854776.1854818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1854776.1854818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:12Z","timestamp":1750248492000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1854776.1854818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,2]]},"references-count":19,"alternative-id":["10.1145\/1854776.1854818","10.1145\/1854776"],"URL":"https:\/\/doi.org\/10.1145\/1854776.1854818","relation":{},"subject":[],"published":{"date-parts":[[2010,8,2]]},"assertion":[{"value":"2010-08-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}