{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:43:49Z","timestamp":1765057429822,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/bibe.2003.1188932","type":"proceedings-article","created":{"date-parts":[[2003,11,21]],"date-time":"2003-11-21T01:19:26Z","timestamp":1069377566000},"page":"79-86","source":"Crossref","is-referenced-by-count":18,"title":["An investigation of phylogenetic likelihood methods"],"prefix":"10.1109","author":[{"given":"T.L.","family":"Williams","sequence":"first","affiliation":[]},{"given":"B.M.E.","family":"Moret","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01731581"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.molbev.a026160"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.molbev.a025924"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.222522599"},{"key":"ref15","first-page":"343","article-title":"Sequence length requirements for phylogenetic methods","author":"moret","year":"2002","journal-title":"Proc 2nd Int'l Workshop Algs in Bioinformatics (WABI'02)"},{"key":"ref16","first-page":"211","article-title":"The accuracy of fast phylogenetic methods for large datasets","volume":"2002","author":"nakhlehn","year":"2002","journal-title":"Proc 7th Pacific Symp on Biocomputing (PSB'02)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/10.1.41"},{"journal-title":"Molecular Evolution A Phylogenetic Approach","year":"1998","author":"page","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/13.3.235"},{"key":"ref28","first-page":"1396","article-title":"Maximum likelihood estimation of phylogeny from dna sequences when substitution rates differ over sites","volume":"10","author":"yang","year":"1993","journal-title":"Mol Biol Evol"},{"key":"ref4","first-page":"156","article-title":"Markov chain Monte Carlo maximum likelihood","author":"geyer","year":"1991","journal-title":"Computing Science and Statistics Proceedings of the 23rd Symposium on the Interface"},{"key":"ref27","article-title":"An investigation of phylogenetic likelihood methods","author":"williams","year":"2002","journal-title":"Technical Report TR-CS-2002&#x2013;33"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935494"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.8.754"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1089\/106652799318337"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1065889"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01734359"},{"key":"ref9","first-page":"118","article-title":"Solving large scale phylogenetic problems using DCM2","author":"huson","year":"1999","journal-title":"ISMB99"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1117\/12.434868"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.molbev.a003881"},{"key":"ref22","article-title":"The neighnbor-joining method: A new method for reconstructiong phylogenetic trees","volume":"4","author":"saitou","year":"1987","journal-title":"Mol Biol Evol"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(81)90043-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.502"},{"journal-title":"r8s software package","year":"0","author":"sanderson","key":"ref23"},{"journal-title":"PAUP* Phylogenetic Analysis Using Parsimony (and Other Methods)","year":"1996","author":"swofford","key":"ref26"},{"key":"ref25","article-title":"Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining","author":"john","year":"2003","journal-title":"J Algorithms"}],"event":{"name":"Third IEEE Symposium on BioInformatics and BioEngineering. BIBE 2003","acronym":"BIBE-03","location":"Bethesda, MD, USA"},"container-title":["Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8465\/26663\/01188932.pdf?arnumber=1188932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T22:32:07Z","timestamp":1489444327000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1188932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/bibe.2003.1188932","relation":{},"subject":[]}}