乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:42:47Z","timestamp":1740159767784,"version":"3.37.3"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":1172,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1016\/j.procs.2010.04.118","type":"journal-article","created":{"date-parts":[[2010,6,7]],"date-time":"2010-06-07T08:11:36Z","timestamp":1275898296000},"page":"1065-1073","source":"Crossref","is-referenced-by-count":6,"title":["Parallel computation of phylogenetic consensus trees"],"prefix":"10.1016","volume":"1","author":[{"given":"Andre J.","family":"Aberer","sequence":"first","affiliation":[]},{"given":"Nicholas D.","family":"Pattengale","sequence":"additional","affiliation":[]},{"given":"Alexandros","family":"Stamatakis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.procs.2010.04.118_br000005","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1101\/gr.11.1.3","article-title":"Pyrosequencing Sheds Light on DNA Sequencing","volume":"11","author":"Ronaghi","year":"2001","journal-title":"Genome Research"},{"key":"10.1016\/j.procs.2010.04.118_br000010","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."},{"issue":"1","key":"10.1016\/j.procs.2010.04.118_br000015","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/bioinformatics\/bti1027","article-title":"Maximum likelihood of evolutionary trees: hardness and approximation","volume":"21","author":"Chor","year":"2005","journal-title":"Bioinformatics"},{"issue":"21","key":"10.1016\/j.procs.2010.04.118_br000020","doi-asserted-by":"crossref","first-page":"2688","DOI":"10.1093\/bioinformatics\/btl446","article-title":"RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models","volume":"22","author":"Stamatakis","year":"2006","journal-title":"Bioinformatics"},{"key":"10.1016\/j.procs.2010.04.118_br000025","unstructured":"D. Zwickl, Genetic Algorithm Approaches for the Phylogenetic Analysis of Large Biological Sequence Datasets under the Maximum Likelihood Criterion, Ph.D. thesis, University of Texas at Austin (April 2006)."},{"issue":"5898","key":"10.1016\/j.procs.2010.04.118_br000030","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1126\/science.1163197","article-title":"Rates of Molecular Evolution Are Linked to Life History in Flowering Plants","volume":"322","author":"Smith","year":"2008","journal-title":"Science"},{"key":"10.1016\/j.procs.2010.04.118_br000035","unstructured":"D. Bryant, A classification of consensus methods for phylogenetics."},{"key":"10.1016\/j.procs.2010.04.118_br000040","unstructured":"J. Felsenstein, Phylip - phylogeny inference package (version 3.2), Cladistics 5 (1989) 164\u2013166."},{"key":"10.1016\/j.procs.2010.04.118_br000045","unstructured":"D.L. Swofford, Paup*. phylogenetic analysis using parsimony (*and other methods). version 4. (2003)."},{"issue":"4","key":"10.1016\/j.procs.2010.04.118_br000050","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1111\/j.1558-5646.1985.tb00420.x","article-title":"Confidence Limits on Phylogenies: An Approach Using the Bootstrap","volume":"39","author":"Felsenstein","year":"1985","journal-title":"Evolution"},{"key":"10.1016\/j.procs.2010.04.118_br000055","series-title":"RECOMB09: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology","first-page":"184","article-title":"How many bootstrap replicates are necessary?","author":"Pattengale","year":"2009"},{"key":"10.1016\/j.procs.2010.04.118_br000060","series-title":"PRIB","first-page":"424","article-title":"Exploiting Fine-Grained Parallelism in the Phylogenetic Likelihood Function with MPI, Pthreads, and OpenMP: A Performance Study","volume":"Vol. 5265","author":"Stamatakis","year":"2008"},{"key":"10.1016\/j.procs.2010.04.118_br000065","series-title":"Proceedings of 5th Intl. Symposium on Bioinformatics Research and Applications (ISBRA\u201909)","first-page":"100","article-title":"An experimental analysis of consensus tree algorithms for large-scale tree collections","volume":"5542","author":"Sul","year":"2009"},{"key":"10.1016\/j.procs.2010.04.118_br000070","unstructured":"D.L. Swofford, PAUP*: Phylogenetic analysis using parsimony (* and other methods), version 4.0b10, Sinauer Associates, 2002."},{"key":"10.1016\/j.procs.2010.04.118_br000075","first-page":"239","article-title":"Consensus n-trees","volume":"43","author":"Margush","year":"1981","journal-title":"Bulletin of Mathematical Biology"},{"key":"10.1016\/j.procs.2010.04.118_br000080","series-title":"Mathematics the the Archeological and Historical Sciences","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"Buneman","year":"1971"},{"issue":"6","key":"10.1016\/j.procs.2010.04.118_br000085","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1089\/cmb.2007.R012","article-title":"Efficiently computing the Robinson-Foulds metric","volume":"14","author":"Pattengale","year":"2007","journal-title":"J. Comput. Biol."},{"issue":"1","key":"10.1016\/j.procs.2010.04.118_br000090","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","article-title":"Efficient algorithms for inferring evolutionary trees","volume":"21","author":"Gusfield","year":"1991","journal-title":"Networks"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050910001195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050910001195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T21:04:06Z","timestamp":1615842246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050910001195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["S1877050910001195"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2010.04.118","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2010,5]]}}}