{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T21:19:46Z","timestamp":1758403186568},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2723,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Biomedical Informatics"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1016\/j.jbi.2005.11.001","type":"journal-article","created":{"date-parts":[[2005,11,29]],"date-time":"2005-11-29T13:50:14Z","timestamp":1133272214000},"page":"43-50","source":"Crossref","is-referenced-by-count":4,"title":["Representation in stochastic search for phylogenetic tree reconstruction"],"prefix":"10.1016","volume":"39","author":[{"given":"Griffin","family":"Weber","sequence":"first","affiliation":[]},{"given":"Lucila","family":"Ohno-Machado","sequence":"additional","affiliation":[]},{"given":"Stuart","family":"Shieber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jbi.2005.11.001_bib1","series-title":"Biological sequence analysis","author":"Durbin","year":"1998"},{"key":"10.1016\/j.jbi.2005.11.001_bib2","doi-asserted-by":"crossref","unstructured":"Rice K., Warnow T. Parsimony is hard to beat. In: Proceedings of COCOON, 1997.","DOI":"10.1007\/BFb0045079"},{"issue":"2","key":"10.1016\/j.jbi.2005.11.001_bib3","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/BF01734359","article-title":"Evolutionary trees from DNA sequences: a maximum likelihood approach","volume":"17","author":"Felsenstein","year":"1981","journal-title":"J Mol Evol"},{"key":"10.1016\/j.jbi.2005.11.001_bib4","series-title":"Bioinformatics: sequence and genome analysis","author":"Mount","year":"2001"},{"key":"10.1016\/j.jbi.2005.11.001_bib5","unstructured":"Kim J., Warnow T. Tutorial on phylogenetic tree estimation, 1999."},{"key":"10.1016\/j.jbi.2005.11.001_bib6","unstructured":"Salter L. Algorithms for phylogenetic tree reconstruction. In Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences, 2002, pp. 459\u2013465."},{"key":"10.1016\/j.jbi.2005.11.001_bib7","unstructured":"Swofford D. PAUP*, phylogenetic analysis using parsimony (and other methods), 2003."},{"issue":"1","key":"10.1016\/j.jbi.2005.11.001_bib8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1093\/biomet\/72.1.191","article-title":"Applications of the annealing algorithm to combinatorial problems in statistics","volume":"72","author":"Lundy","year":"1985","journal-title":"Biometrika"},{"key":"10.1016\/j.jbi.2005.11.001_bib9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","article-title":"Convergence of an annealing algorithm","volume":"34","author":"Lundy","year":"1986","journal-title":"Math Program"},{"key":"10.1016\/j.jbi.2005.11.001_bib10","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0196-8858(87)90003-0","article-title":"Parsimonious phylogenetic trees in metric spaces and simulated annealing","volume":"8","author":"Dress","year":"1987","journal-title":"Adv Appl Math"},{"key":"10.1016\/j.jbi.2005.11.001_bib11","doi-asserted-by":"crossref","unstructured":"Ganapathy G., et al. Better hill-climbing searches for parsimony. In: 3rd Workshop on Algorithms in Bioinformatics, 2003.","DOI":"10.1007\/978-3-540-39763-2_19"},{"issue":"3","key":"10.1016\/j.jbi.2005.11.001_bib12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/2992325","article-title":"The discovery and importance of multiple islands of most-parsimonious trees","volume":"40","author":"Maddison","year":"1991","journal-title":"Syst Zool"},{"issue":"3","key":"10.1016\/j.jbi.2005.11.001_bib13","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1093\/sysbio\/46.3.554","article-title":"Analyzing large data sets: rbcL500 revisited","volume":"46","author":"Rice","year":"1997","journal-title":"Syst Biol"},{"issue":"2","key":"10.1016\/j.jbi.2005.11.001_bib14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF02192530","article-title":"Easily searched encodings for number partitioning","volume":"89","author":"Ruml","year":"1996","journal-title":"J Optimiz Theory Appl"},{"key":"10.1016\/j.jbi.2005.11.001_bib15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1111\/j.1096-0031.1996.tb00009.x","article-title":"Methods for Faster Parsimony Analysis","volume":"12","author":"Goloboff","year":"1996","journal-title":"Cladistics"},{"key":"10.1016\/j.jbi.2005.11.001_bib16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1111\/j.1096-0031.1998.tb00346.x","article-title":"Fast fitch-parsimony algorithms for large data sets","volume":"14","author":"Ronquist","year":"1998","journal-title":"Cladistics"},{"key":"10.1016\/j.jbi.2005.11.001_bib17","unstructured":"Weber G. Data Representation and Algorithms for Biomedical Informatics Applications. PhD thesis, Harvard University, Cambridge, MA, 2005."},{"key":"10.1016\/j.jbi.2005.11.001_bib18","series-title":"Proceedings of Algorithms and Experiments (ALEX98)","first-page":"76","article-title":"A seed-growth heuristic for graph bisection","author":"Marks","year":"1998"},{"issue":"4","key":"10.1016\/j.jbi.2005.11.001_bib19","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1111\/j.1096-0031.1999.tb00278.x","article-title":"Analyzing large data sets in reasonable times: solutions for composite optima","volume":"15","author":"Goloboff","year":"1999","journal-title":"Cladistics"},{"key":"10.1016\/j.jbi.2005.11.001_bib20","series-title":"Proceedings of Algorithms and Experiments (ALEX98)","first-page":"62","article-title":"The disk-covering method for tree reconstruction","author":"Huson","year":"1998"},{"issue":"4","key":"10.1016\/j.jbi.2005.11.001_bib21","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1111\/j.1096-0031.1999.tb00277.x","article-title":"The parsimony Ratchet, a new method for rapid parsimony analysis","volume":"15","author":"Nixon","year":"1999","journal-title":"Cladistics"}],"container-title":["Journal of Biomedical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1532046405001115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1532046405001115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T17:55:41Z","timestamp":1548006941000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1532046405001115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["S1532046405001115"],"URL":"https:\/\/doi.org\/10.1016\/j.jbi.2005.11.001","relation":{},"ISSN":["1532-0464"],"issn-type":[{"value":"1532-0464","type":"print"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}