{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:17:38Z","timestamp":1720696658352},"reference-count":41,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1016\/j.ejor.2003.10.054","type":"journal-article","created":{"date-parts":[[2004,5,15]],"date-time":"2004-05-15T10:35:24Z","timestamp":1084617324000},"page":"585-597","source":"Crossref","is-referenced-by-count":20,"title":["Selected combinatorial problems of computational biology"],"prefix":"10.1016","volume":"161","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Formanowicz","sequence":"additional","affiliation":[]},{"given":"Marta","family":"Kasprzak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2003.10.054_BIB1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0022-5193(88)80246-7","article-title":"A novel method for nucleic acid sequence determination","volume":"135","author":"Bains","year":"1988","journal-title":"Journal of Theoretical Biology"},{"key":"10.1016\/j.ejor.2003.10.054_BIB2","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","article-title":"On the topology of the genetic fine structure","volume":"45","author":"Benzer","year":"1959","journal-title":"Proceedings of the National Academy of Sciences of the USA"},{"key":"10.1016\/j.ejor.2003.10.054_BIB3","unstructured":"J. B\u0142a\u017cewicz, P. Formanowicz, F. Glover, M. Kasprzak, J. W\u0229glarz, An improved tabu search algorithm for DNA sequencing with errors, in: Proceedings of the III Metaheuristics International Conference MIC'99, pp. 69\u201375"},{"key":"10.1016\/j.ejor.2003.10.054_BIB4","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1093\/bioinformatics\/18.5.652","article-title":"A heuristic managing errors for DNA sequencing","volume":"18","author":"B\u0142a\u017cewicz","year":"2002","journal-title":"Bioinformatics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB5","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1093\/bioinformatics\/17.5.398","article-title":"Construction of DNA restriction maps based on a simplified experiment","volume":"17","author":"B\u0142a\u017cewicz","year":"2001","journal-title":"Bioinformatics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(01)00133-9","article-title":"On the recognition of de Bruijn graphs and their induced subgraphs","volume":"245","author":"B\u0142a\u017cewicz","year":"2002","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB7","unstructured":"J. B\u0142a\u017cewicz, P. Formanowicz, M. Kasprzak, W.T. Markiewicz, Method of sequencing of nucleic acids, The Patent Office of the Republic of Poland, Patent Application No. P 335786, 1999"},{"key":"10.1016\/j.ejor.2003.10.054_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1089\/cmb.1999.6.113","article-title":"DNA sequencing with positive and negative errors","volume":"6","author":"B\u0142a\u017cewicz","year":"1999","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.ejor.2003.10.054_BIB9","doi-asserted-by":"crossref","unstructured":"J. B\u0142a\u017cewicz, F. Glover, M. Kasprzak, DNA sequencing\u2013\u2013tabu and scatter search combined, INFORMS Journal on Computing, in press","DOI":"10.1287\/ijoc.1030.0049"},{"key":"10.1016\/j.ejor.2003.10.054_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00109-2","article-title":"On some properties of DNA graphs","volume":"98","author":"B\u0142a\u017cewicz","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB11","unstructured":"J. B\u0142a\u017cewicz, M. Jaroszewski, M. Kasprzak, B. Pali\u015bwiat, P. Pryputniewicz, On the complexity of the double digest problem, Control & Cybernetics (2004) in press"},{"key":"10.1016\/j.ejor.2003.10.054_BIB12","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/S0304-3975(02)00063-4","article-title":"Complexity of DNA sequencing by hybridization","volume":"290","author":"B\u0142a\u017cewicz","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2003.10.054_BIB13","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1016589707123","article-title":"Hybrid genetic algorithm for DNA sequencing with errors","volume":"8","author":"B\u0142a\u017cewicz","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB14","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"10.1016\/j.ejor.2003.10.054_BIB15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0888-7543(89)90290-5","article-title":"Sequencing of megabase plus DNA by hybridization: Theory of the method","volume":"4","author":"Drmanac","year":"1989","journal-title":"Genomics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB16","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1080\/07391102.1991.10507867","article-title":"An algorithm for the DNA sequence generation from k-tuple word contents of the minimal number of random fragments","volume":"8","author":"Drmanac","year":"1991","journal-title":"Journal of Biomolecular Structure and Dynamics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB17","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1126\/science.1990438","article-title":"Light-directed, spatially addressable parallel chemical synthesis","volume":"251","author":"Fodor","year":"1991","journal-title":"Science"},{"key":"10.1016\/j.ejor.2003.10.054_BIB18","series-title":"Evolutionary Computation in Bioinformatics","year":"2003"},{"key":"10.1016\/j.ejor.2003.10.054_BIB19","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB20","series-title":"Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"key":"10.1016\/j.ejor.2003.10.054_BIB21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.3230240506","article-title":"Maximum likelihood genetic sequence reconstruction from oligo content","volume":"24","author":"Hagstrom","year":"1994","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2003.10.054_BIB22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","article-title":"A new algorithm for DNA sequence assembly","volume":"2","author":"Idury","year":"1995","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.ejor.2003.10.054_BIB23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","article-title":"The selective travelling salesman problem","volume":"26","author":"Laporte","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB24","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1080\/07391102.1993.10508020","article-title":"Likelihood DNA sequencing by hybridization","volume":"11","author":"Lipshutz","year":"1993","journal-title":"Journal of Biomolecular Structure and Dynamics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB25","first-page":"1508","article-title":"Determination of the nucleotide sequence of DNA using hybridization with oligonucleotides. A new method","volume":"303","author":"Lysov","year":"1988","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"10.1016\/j.ejor.2003.10.054_BIB26","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1089\/cmb.1995.2.275","article-title":"Toward simplifying and accurately formulating fragment assembly","volume":"2","author":"Myers","year":"1995","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.ejor.2003.10.054_BIB27","doi-asserted-by":"crossref","first-page":"5022","DOI":"10.1073\/pnas.91.11.5022","article-title":"Light-generated oligonucleotide arrays for rapid DNA sequence analysis","volume":"91","author":"Pease","year":"1994","journal-title":"Proceedings of the National Academy of Sciences of the USA"},{"key":"10.1016\/j.ejor.2003.10.054_BIB28","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0166-218X(02)00287-1","article-title":"Recognizing DNA graphs is difficult","volume":"127","author":"Pendavingh","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB29","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","article-title":"l-Tuple DNA sequencing: Computer analysis","volume":"7","author":"Pevzner","year":"1989","journal-title":"Journal of Biomolecular Structure and Dynamics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB30","series-title":"Computational Molecular Biology. An Algorithmic Approach","author":"Pevzner","year":"2000"},{"key":"10.1016\/j.ejor.2003.10.054_BIB31","doi-asserted-by":"crossref","unstructured":"P.A. Pevzner, H. Tang, M.S. Waterman, A new approach to fragment assembly in DNA sequencing, in: Proceedings of the Fifth Annual International Conference on Computational Molecular Biology, RECOMB 2001, pp. 256\u2013267","DOI":"10.1145\/369133.369230"},{"key":"10.1016\/j.ejor.2003.10.054_BIB32","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/0196-8858(91)90028-H","article-title":"Multiple solutions of DNA restriction mapping problems","volume":"12","author":"Schmitt","year":"1991","journal-title":"Advances in Applied Mathematics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB33","series-title":"Introduction to Computational Molecular Biology","author":"Setubal","year":"1997"},{"key":"10.1016\/j.ejor.2003.10.054_BIB34","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02460643","article-title":"A partial digest approach to restriction site mapping","volume":"56","author":"Skiena","year":"1994","journal-title":"Bulletin of Mathematical Biology"},{"key":"10.1016\/j.ejor.2003.10.054_BIB35","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"The identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"Journal of Molecular Biology"},{"key":"10.1016\/j.ejor.2003.10.054_BIB36","unstructured":"E.M. Southern, United Kingdom Patent Application GB8810400, 1988"},{"key":"10.1016\/j.ejor.2003.10.054_BIB37","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1016\/0888-7543(92)90014-J","article-title":"Analyzing and comparing nucleic acid sequences by hybridization to arrays of oligonucleotides: Evaluation using experimental models","volume":"13","author":"Southern","year":"1992","journal-title":"Genomics"},{"key":"10.1016\/j.ejor.2003.10.054_BIB38","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/j.ejor.2003.10.054_BIB39","series-title":"Introduction to Computational Biology. Maps, Sequences and Genomes","author":"Waterman","year":"1995"},{"key":"10.1016\/j.ejor.2003.10.054_BIB40","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1038\/171964b0","article-title":"Genetic implications of the structure of deoxyribonucleic acid","volume":"171","author":"Watson","year":"1953","journal-title":"Nature"},{"key":"10.1016\/j.ejor.2003.10.054_BIB41","doi-asserted-by":"crossref","unstructured":"P. Wiener, Linear pattern matching algorithms, in: Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1\u201311","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221704002218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221704002218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T04:50:47Z","timestamp":1585803047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221704002218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["S0377221704002218"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2003.10.054","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}