{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:10:46Z","timestamp":1767651046367},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"14","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004,9,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process.<\/jats:p>\n               <jats:p>Results: The present method outperforms those described in previous studies, in terms of both time and accuracy.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/kamit.med.u-tokai.ac.jp\/~takaho\/sbh\/index.html<\/jats:p>","DOI":"10.1093\/bioinformatics\/bth202","type":"journal-article","created":{"date-parts":[[2004,4,13]],"date-time":"2004-04-13T00:34:51Z","timestamp":1081816491000},"page":"2181-2188","source":"Crossref","is-referenced-by-count":19,"title":["Probabilistic nucleotide assembling method for sequencing by hybridization"],"prefix":"10.1093","volume":"20","author":[{"given":"Takaho A.","family":"Endo","sequence":"first","affiliation":[{"name":"Division of Molecular Life Sciences, Department of Genetic Information, School of Medicine, Tokai University, Bouseidai, Isehara, Kanagawa, 259-1193, Japan"}]}],"member":"286","published-online":{"date-parts":[[2004,4,8]]},"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/20\/14\/2181\/48906148\/bioinformatics_20_14_2181.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/20\/14\/2181\/48906148\/bioinformatics_20_14_2181.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T16:10:21Z","timestamp":1674663021000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/20\/14\/2181\/213800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4,8]]},"references-count":0,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2004,9,22]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bth202","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2004,9,22]]},"published":{"date-parts":[[2004,4,8]]}}}