{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:52:45Z","timestamp":1740135165740,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:00:00Z","timestamp":1560816000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:00:00Z","timestamp":1560816000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D Program of China","award":["2016YFB0800602"],"award-info":[{"award-number":["2016YFB0800602"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s12859-019-2862-x","type":"journal-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T13:02:41Z","timestamp":1560862961000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["DDmap: a MATLAB package for the double digest problem using multiple genetic operators"],"prefix":"10.1186","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8418-1897","authenticated-orcid":false,"given":"Licheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwen","family":"Suo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,18]]},"reference":[{"issue":"1","key":"2862_CR1","first-page":"133","volume":"33","author":"J Blazewicz","year":"2004","unstructured":"Blazewicz J, Burke E, Jaroszewski M, Kasprzak M, Paliswiat B, Pryputniewicz P. On the complexity of the double digest problem. Control Cybern. 2004;33(1):133\u201340.","journal-title":"Control Cybern"},{"key":"2862_CR2","doi-asserted-by":"crossref","unstructured":"Cieliebak M, Eidenbenz S, Woeginger GJ. Double digest revisited: complexity and Approximability in the presence of Noisy data. In: International conference on Computing & Combinatorics: Springer-Verlag; 2003. p. 519\u201327.","DOI":"10.1007\/3-540-45071-8_52"},{"issue":"10","key":"2862_CR3","doi-asserted-by":"publisher","first-page":"453","DOI":"10.6026\/97320630008453","volume":"8","author":"M Ganjtabesh","year":"2012","unstructured":"Ganjtabesh M, Ahrabian H, Nowari-Dalini A, Moghadam ZRK. Genetic algorithm solution for double digest problem. Bioinformation. 2012;8(10):453\u20136.","journal-title":"Bioinformation"},{"key":"2862_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0196-8858(87)90013-3","volume":"8","author":"L Goldstein","year":"1987","unstructured":"Goldstein L, Waterman MS. Mapping DNA by stochastic relaxation. Adv Appl Math. 1987;8:194\u2013207.","journal-title":"Adv Appl Math"},{"issue":"1","key":"2862_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1021946523069","volume":"7","author":"MY Kao","year":"2003","unstructured":"Kao MY, Samet J, Sung WK. The enhanced double digest problem for dna physical mapping. J Comb Optim. 2003;7(1):69\u201378.","journal-title":"J Comb Optim"},{"key":"2862_CR6","first-page":"278","volume-title":"ACM symposium on theory of computing","author":"R Karp","year":"1993","unstructured":"Karp R. Mapping the genome: some combinatorial problems arising in molecular biology. In: ACM symposium on theory of computing; 1993. p. 278\u201385."},{"key":"2862_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1146\/annurev.bi.44.070175.001421","volume":"44","author":"D Nathans","year":"1975","unstructured":"Nathans D, Smith HO. Restriction endonuleases in the analysis and restructuring of DNA molecules. Annu Rev Biochem. 1975;44:273\u201393.","journal-title":"Annu Rev Biochem"},{"key":"2862_CR8","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science 8: Mathematical Methods of Analysis of Biopolymer Sequences, pages 99\u2013112","author":"PA Pevzner","year":"1992","unstructured":"Pevzner PA. DNA physical mapping, flows in networks and minimum cycles mean in graphs. In: Gindikin SG, editor. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 8: Mathematical Methods of Analysis of Biopolymer Sequences, pages 99\u2013112. Providence: American Mathematical Society; 1992."},{"issue":"1\/2","key":"2862_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01188582","volume":"13","author":"PA Pevzner","year":"1995","unstructured":"Pevzner PA. DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica. 1995;13(1\/2):77\u2013105.","journal-title":"Algorithmica"},{"key":"2862_CR10","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/0196-8858(91)90028-H","volume":"12","author":"W Schmitt","year":"1991","unstructured":"Schmitt W, Waterman MS. Multiple solutions of DNA restriction mapping problems. Adv Appl Math. 1991;12:412\u201327.","journal-title":"Adv Appl Math"},{"issue":"2","key":"2862_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-2836(70)90149-X","volume":"51","author":"HO Smith","year":"1970","unstructured":"Smith HO, Wilcox KW. A restriction enzyme from Hemophilus influenzae. I. Purification and general properties. J Mol Biol. 1970;51(2):379\u201391.","journal-title":"J Mol Biol"},{"key":"2862_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0004-3702(78)90013-9","volume":"11","author":"M Stefik","year":"1978","unstructured":"Stefik M. Inferring DNA structure from segmentation data. Artif Intell. 1978;11:85\u2013114.","journal-title":"Artif Intell"},{"key":"2862_CR13","volume-title":"International conference on Pattern Recognition & Machine Intelligence","author":"S Sur-Kolay","year":"2005","unstructured":"Sur-Kolay S, Banerjee S, Mukhopadhyaya S, et al. Genetic algorithm for double digest problem. In: International conference on Pattern Recognition & Machine Intelligence. Berlin Heidelberg: Springer; 2005."},{"issue":"2","key":"2862_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02460022","volume":"48","author":"MS Waterman","year":"1986","unstructured":"Waterman MS, Griggs JR. Interval graphs and maps of DNA. Bull Math Biol. 1986;48(2):189\u201395.","journal-title":"Bull Math Biol"},{"issue":"4","key":"2862_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1504\/IJBRA.2008.021173","volume":"4","author":"Z Wu","year":"2008","unstructured":"Wu Z, Zhang Y. Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming. Int J Bioinforma Res Appl. 2008;4(4):351.","journal-title":"Int J Bioinforma Res Appl"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-2862-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-019-2862-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-2862-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T23:05:26Z","timestamp":1592348726000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-019-2862-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,18]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["2862"],"URL":"https:\/\/doi.org\/10.1186\/s12859-019-2862-x","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2019,6,18]]},"assertion":[{"value":"19 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"348"}}