{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:11:18Z","timestamp":1747807878834},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357483"},{"type":"electronic","value":"9783540357506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785231_106","type":"book-chapter","created":{"date-parts":[[2006,7,2]],"date-time":"2006-07-02T06:01:11Z","timestamp":1151820071000},"page":"1008-1017","source":"Crossref","is-referenced-by-count":6,"title":["DNA Fragment Assembly by Ant Colony and Nearest Neighbour Heuristics"],"prefix":"10.1007","author":[{"given":"Wannasak","family":"Wetcharaporn","sequence":"first","affiliation":[]},{"given":"Nachol","family":"Chaiyaratana","sequence":"additional","affiliation":[]},{"given":"Sissades","family":"Tongsima","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"106_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/6.993809","volume":"39","author":"A. Applewhite","year":"2002","unstructured":"Applewhite, A.: Mining the genome. IEEE Spectrum\u00a039(4), 69\u201371 (2002)","journal-title":"IEEE Spectrum"},{"issue":"7","key":"106_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/MC.2002.1016901","volume":"35","author":"M. Pop","year":"2002","unstructured":"Pop, M., Salzberg, S.L., Shumway, M.: Genome sequence assembly: Algorithms and issues. Computer\u00a035(7), 47\u201354 (2002)","journal-title":"Computer"},{"issue":"9","key":"106_CR3","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1101\/gr.9.9.868","volume":"9","author":"X. Huang","year":"1999","unstructured":"Huang, X., Madan, A.: CAP3: A DNA sequence assembly program. Genome Research\u00a09(9), 868\u2013877 (1999)","journal-title":"Genome Research"},{"key":"106_CR4","unstructured":"Green, P.: Phrap documentation. Phred, Phrap, and Consed (2004), \n                    \n                      http:\/\/www.phrap.org"},{"issue":"1-2","key":"106_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0166-218X(00)00324-3","volume":"116","author":"C.E. Ferreira","year":"2002","unstructured":"Ferreira, C.E., de Souza, C.C., Wakabayashi, Y.: Rearrangement of DNA fragments: A branch-and-cut algorithm. Discrete Applied Mathematics\u00a0116(1-2), 161\u2013177 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"106_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1101\/gr.208902","volume":"12","author":"S. Batzoglou","year":"2002","unstructured":"Batzoglou, S., Jaffe, D., Stanley, K., Butler, J., Gnerre, S., Mauceli, E., Berger, B., Mesirov, J.P., Lander, E.S.: ARACHNE: A whole-genome shotgun assembler. Genome Research\u00a012(1), 177\u2013189 (2002)","journal-title":"Genome Research"},{"issue":"1-2","key":"106_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01188580","volume":"13","author":"J.D. Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Myers, E.W.: Combinatorial algorithms for DNA sequence assembly. Algorithmica\u00a013(1-2), 7\u201351 (1995)","journal-title":"Algorithmica"},{"issue":"17","key":"106_CR8","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P.A. Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences of the United States of America\u00a098(17), 9748\u20139753 (2001)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"106_CR9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/B978-0-08-092639-1.50038-1","volume-title":"Automated DNA Sequencing and Analysis","author":"C. Burks","year":"1994","unstructured":"Burks, C., Engle, M., Forrest, S., Parsons, R., Soderlund, C., Stolorz, P.: Stochastic optimization tools for genomic sequence assembly. In: Adams, M.D., Fields, C., Venter, J.C. (eds.) Automated DNA Sequencing and Analysis, pp. 249\u2013259. Academic Press, London (1994)"},{"issue":"1-2","key":"106_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00993377","volume":"21","author":"R.J. Parsons","year":"1995","unstructured":"Parsons, R.J., Forrest, S., Burks, C.: Genetic algorithms, operators, and DNA fragment assembly. Machine Learning\u00a021(1-2), 11\u201333 (1995)","journal-title":"Machine Learning"},{"issue":"3-4","key":"106_CR11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/01966324.1997.10737444","volume":"17","author":"R.J. Parsons","year":"1997","unstructured":"Parsons, R.J., Johnson, M.E.: A case study in experimental design applied to genetic algorithms with applications to DNA sequence assembly. American Journal of Mathematical and Management Sciences\u00a017(3-4), 369\u2013396 (1997)","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"106_CR12","unstructured":"Kim, K., Mohan, C.K.: Parallel hierarchical adaptive genetic algorithm for fragment assembly. In: Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, Australia, pp. 600\u2013607 (2003)"},{"issue":"6","key":"106_CR13","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1142\/S0129065799000563","volume":"9","author":"E. Angeleri","year":"1999","unstructured":"Angeleri, E., Apolloni, B., de Falco, D., Grandi, L.: DNA fragment assembly using neural prediction techniques. International Journal of Neural Systems\u00a09(6), 523\u2013544 (1999)","journal-title":"International Journal of Neural Systems"},{"issue":"1","key":"106_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"106_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"key":"106_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1093\/nar\/gki063","volume":"33","author":"D.A. Benson","year":"2005","unstructured":"Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Wheeler, D.L.: GenBank. Nucleic Acids Research\u00a033, D34\u2013D38 (2005)","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing \u2013 ICAISC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785231_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:31Z","timestamp":1605643711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785231_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357483","9783540357506"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11785231_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}