{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:52Z","timestamp":1725518452779},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icecc.2004.1269584","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"264-269","source":"Crossref","is-referenced-by-count":0,"title":["Usefulness of solution algorithms of the traveling salesman problem in the typing of biological sequences in a clinical laboratory setting"],"prefix":"10.1109","author":[{"given":"J.G.","family":"Eisele","sequence":"first","affiliation":[]},{"given":"C.Y.C.","family":"Roldan","sequence":"additional","affiliation":[]},{"given":"M.O.","family":"Galindo","sequence":"additional","affiliation":[]},{"given":"Md.P.G.","family":"Gil","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"journal-title":"Desarrollo de Algoritmos para la Clasificacio?n de Secuencias","year":"2002","author":"ferna?ndez pello?n zambrano","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"journal-title":"Introduction to Algorithms 6th Edition","year":"1992","author":"cormen","key":"13"},{"journal-title":"Algoritmos y Estructuras","year":"2003","author":"meza","key":"14"},{"journal-title":"Matema?ticas Discretas","year":"1990","author":"ross","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5"},{"journal-title":"Biologi?a Molecular en la Cli?nica","year":"2000","author":"panduro","key":"3"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"2"},{"journal-title":"Computer Algorithms Introduction to Design & Analysis 3rd Edition","year":"2002","author":"baase","key":"1"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"10"},{"journal-title":"Estudio Comparative de Diversos Me?todos de Solucio?n del Problema del Agente Viajero (PAV)","year":"2000","author":"castan?eda rolda?n","key":"7"},{"key":"6","article-title":"El pequen?o universo del Problema del Agente Viajero dentro de la Tipificacio?n de Secuencias (DNA)","author":"garce?s eisele","year":"2003","journal-title":"CONIELECOMP"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-50124-1_2"},{"year":"0","key":"4"},{"key":"9","article-title":"Hi?brido MST-2Opt para la Solucio?n Aproximada del Problema del Agente Viajero y la Tipificacio?n de Secuencias de DNA en Modelos Virales","author":"castan?eda rolda?n","year":"2003","journal-title":"SAAEIE03"},{"year":"0","key":"8"}],"event":{"name":"14th International Conference on Electronics, Communications and Computers, 2004. CONIELECOMP 2004.","start":{"date-parts":[[2004,2,18]]},"location":"Veracruz, Mexico","end":{"date-parts":[[2004,2,18]]}},"container-title":["14th International Conference on Electronics, Communications and Computers, 2004. CONIELECOMP 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8958\/28388\/01269584.pdf?arnumber=1269584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T01:23:08Z","timestamp":1489454588000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1269584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icecc.2004.1269584","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}