{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:04:57Z","timestamp":1773277497588,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"S19","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s12859-016-1365-2","type":"journal-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T12:44:50Z","timestamp":1482410690000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A fast exact sequential algorithm for the partial digest problem"],"prefix":"10.1186","volume":"17","author":[{"given":"Mostafa M.","family":"Abbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hazem M.","family":"Bahig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,22]]},"reference":[{"issue":"1\u20132","key":"1365_CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01188582","volume":"13","author":"P Pevzner","year":"1995","unstructured":"Pevzner P. DNA physical mapping and alternating eulerian cycles in colored graphs. Algorithmica. 1995;13(1\u20132):77\u2013105.","journal-title":"Algorithmica"},{"issue":"1","key":"1365_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1038\/nmeth.1807","volume":"9","author":"M Baker","year":"2012","unstructured":"Baker M. Gene-editing nucleases. Nat methods. 2012;9(1):23\u20136.","journal-title":"Nat methods"},{"key":"1365_CR3","volume-title":"Molecular cloning: a laboratory manual","author":"J Sambrook","year":"1989","unstructured":"Sambrook J, Fritsch EF, Maniatis T. Molecular cloning: a laboratory manual. 2nd ed. New York: Cold Spring Harbor Laboratory Press, Cold Spring Harbor; 1989.","edition":"2"},{"issue":"12","key":"1365_CR4","doi-asserted-by":"crossref","first-page":"651","DOI":"10.4103\/1947-2714.104318","volume":"4","author":"Z Liu","year":"2012","unstructured":"Liu Z, Ping-Chang Y. Construction of pET-32 \u03b1 (+) vector for protein expression and purification. N am j med sci. 2012;4(12):651\u20135.","journal-title":"N am j med sci"},{"key":"1365_CR5","doi-asserted-by":"crossref","first-page":"9747","DOI":"10.1038\/srep09747","volume":"5","author":"X He","year":"2015","unstructured":"He X, Hull V, Thomas JA, Fu X, Gidwani S, Gupta YK, Black LW, Xu SY. Expression and purification of a single-chain type IV restriction enzyme Eco94GmrSD and determination of its substrate preference. Sci rep. 2015;5:9747.","journal-title":"Sci rep"},{"key":"1365_CR6","unstructured":"Narayanan P. Bioinformatics: A primer. New Age International. 2005. ISBN 10: 8122416101, ISBN 13: 9788122416107."},{"key":"1365_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0065-2113(09)01006-2","volume":"102","author":"V Kalavacharla","year":"2009","unstructured":"Kalavacharla V, Hossain K, Riera-Lizarazu O, Gu Y, Maan SS, Kianian SF. Radiation hybrid mapping in crop plants. Adv agron. 2009;102:201\u201322.","journal-title":"Adv agron"},{"key":"1365_CR8","doi-asserted-by":"publisher","unstructured":"Dear PH. Genome mapping. eLS 2001. John Wiley & Sons. doi: 10.1038\/npg.els.0001467 .","DOI":"10.1038\/npg.els.0001467"},{"issue":"5","key":"1365_CR9","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1093\/bioinformatics\/17.5.398","volume":"17","author":"J B\u0142a\u017cewicz","year":"2001","unstructured":"B\u0142a\u017cewicz J, Formanowicz P, Kasprzak M, Jaroszewski M, Markiewicz WT. Construction of DNA restriction maps based on a simplified experiment. Bioinformatics. 2001;17(5):398\u2013404.","journal-title":"Bioinformatics"},{"issue":"1","key":"1365_CR10","first-page":"133","volume":"33","author":"B Paliswiat","year":"2004","unstructured":"Paliswiat B, Pryputniewicz P. On the complexity of the double digest problem. Control cybern. 2004;33(1):133\u201340.","journal-title":"Control cybern"},{"key":"1365_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-39763-2_9","volume":"2812","author":"M Cieliebak","year":"2003","unstructured":"Cieliebak M, Eidenbenz S, Penna P. Noisy data make the partial digest problem NP-hard. Lect notes comput cci. 2003;2812:111\u201323.","journal-title":"Lect notes comput cci"},{"issue":"4","key":"1365_CR12","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TCBB.2007.1060","volume":"4","author":"J Blazewicz","year":"2007","unstructured":"Blazewicz J, Burke EK, Kasprzak M, Kovalev A, Kovalyov MY. Simplified partial digest problem: enumerative and dynamic programming algorithms. IEEE\/ACM trans comput biol bioinform. 2007;4(4):668\u201380.","journal-title":"IEEE\/ACM trans comput biol bioinform"},{"issue":"3","key":"1365_CR13","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/S0022-0000(02)00008-9","volume":"65","author":"G Pandurangan","year":"2002","unstructured":"Pandurangan G, Ramesh H. The restriction mapping problem revisited. J comput syst sci. 2002;65(3):526\u201344.","journal-title":"J comput syst sci"},{"issue":"3","key":"1365_CR14","first-page":"229","volume":"11","author":"RM Karp","year":"1995","unstructured":"Karp RM, Newberg LA. An algorithm for analysing probed partial digestion experiments. Comput appl biosci. 1995;11(3):229\u201335.","journal-title":"Comput appl biosci"},{"key":"1365_CR15","unstructured":"Dakic T: On the turnpike problem. PhD thesis, Simon Fraser University 2000, ISBN:0-612-61635-5."},{"key":"1365_CR16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s13160-011-0041-1","volume":"28","author":"R Nadimi","year":"2011","unstructured":"Nadimi R, Fathabadi HS, Ganjtabesh M. A fast algorithm for the partial digest problem. Jpn j ind appl math. 2011;28:315\u201325.","journal-title":"Jpn j ind appl math"},{"issue":"6","key":"1365_CR17","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1504\/IJBRA.2013.056622","volume":"9","author":"H Ahrabian","year":"2013","unstructured":"Ahrabian H, Ganjtabesh M, Nowzari-Dalini A, Razaghi-Moghadam-Kashani Z. Genetic algorithm solution for partial digest problem. Int j bioinform res appl. 2013;9(6):584\u201394.","journal-title":"Int j bioinform res appl"},{"issue":"3","key":"1365_CR18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1137\/0603035","volume":"3","author":"J Rosenblatt","year":"1982","unstructured":"Rosenblatt J, Seymour PD. The structure of homometric sets. SIAM j algebraic discrete meth. 1982;3(3):343\u201350.","journal-title":"SIAM j algebraic discrete meth"},{"key":"1365_CR19","volume-title":"On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating n points on a line, given the (nC2) unlabelled distances between them. Technical report # 453","author":"P Lemke","year":"1988","unstructured":"Lemke P, Werman M. On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating n points on a line, given the (nC2) unlabelled distances between them. Technical report # 453. IMA: Minneapolis; 1988."},{"key":"1365_CR20","doi-asserted-by":"crossref","unstructured":"Skiena SS, Smith WD, Lemke P. Reconstructing sets from interpoint distances. SCG '90 Proceedings of the sixth annual symposium on Computational geometry, 332\u20139.","DOI":"10.1145\/98524.98598"},{"key":"1365_CR21","doi-asserted-by":"crossref","unstructured":"Syropoulos A. Mathematics of multisets. WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View. 2000;347\u201358.","DOI":"10.1007\/3-540-45523-X_17"},{"key":"1365_CR22","unstructured":"Jones NC, Pevzner P. An introduction to bioinformatics algorithms. Chapter 4, 83-123, MIT press 2004."},{"issue":"3","key":"1365_CR23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1089\/cmb.1994.1.235","volume":"1","author":"Z Zhang","year":"1994","unstructured":"Zhang Z. An exponential example for a partial digest mapping algorithm. J comput biol. 1994;1(3):235\u20139.","journal-title":"J comput biol"},{"key":"1365_CR24","doi-asserted-by":"publisher","unstructured":"Woolson RF. Wilcoxon Signed\u2010Rank Test. Wiley encyclopedia of clinical trials 2008. doi: 10.1002\/9780471462422.eoct979 .","DOI":"10.1002\/9780471462422.eoct979"},{"issue":"2","key":"1365_CR25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-4781(93)90172-A","volume":"1173","author":"JH Devine","year":"1993","unstructured":"Devine JH, Kutuzova GD, Green VA, Ugarova NN, Baldwin TO. Luciferase from the east European firefly luciola mingrelica: cloning and nucleotide sequence of the cDNA, overexpression in Escherichia coli and purification of the enzyme. Biochim biophys acta. 1993;1173(2):121\u201332.","journal-title":"Biochim biophys acta"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:26:44Z","timestamp":1749846404000},"score":1,"resource":{"primary":{"URL":"http:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-1365-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":25,"journal-issue":{"issue":"S19","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["1365"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-1365-2","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]},"article-number":"510"}}