乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:46:25Z","timestamp":1648583185240},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1016\/j.jpdc.2009.09.010","type":"journal-article","created":{"date-parts":[[2009,10,17]],"date-time":"2009-10-17T04:30:08Z","timestamp":1255753808000},"page":"237-244","source":"Crossref","is-referenced-by-count":0,"title":["A scalable parallelization of the gene duplication problem"],"prefix":"10.1016","volume":"70","author":[{"given":"Andr\u00e9","family":"Wehe","sequence":"first","affiliation":[]},{"given":"Wen-Chieh","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Eulenstein","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jpdc.2009.09.010_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","article-title":"Subtree transfer operations and their induced metrics on evolutionary trees","volume":"5","author":"Allen","year":"2001","journal-title":"Annals of Combinatorics"},{"key":"10.1016\/j.jpdc.2009.09.010_b2","doi-asserted-by":"crossref","unstructured":"M.S. Bansal, J.G. Burleigh, O. Eulenstein, A. Wehe, Heuristics for the gene-duplication problem: A \u0398(n) speed-up for the local search, in: RECOMB, 2007, pp. 238\u2013252","DOI":"10.1007\/978-3-540-71681-5_17"},{"key":"10.1016\/j.jpdc.2009.09.010_b3","doi-asserted-by":"crossref","unstructured":"M.S. Bansal, O. Eulenstein, An \u03a9(n2\/logn) speed-up of TBR heuristics for the gene-duplication problem, in: WABI, 2007, pp. 124\u2013135","DOI":"10.1007\/978-3-540-74126-8_12"},{"key":"10.1016\/j.jpdc.2009.09.010_b4","doi-asserted-by":"crossref","unstructured":"M.A. Bender, M. Farach-Colton, The LCA problem revisited, in: LATIN, 2000, pp. 88\u201394","DOI":"10.1007\/10719839_9"},{"key":"10.1016\/j.jpdc.2009.09.010_b5","doi-asserted-by":"crossref","unstructured":"P. Bonizzoni, G.D. Vedova, R. Dondi, Reconciling gene trees to a species tree, in: CIAC2003 - Italian Conference on Algorithms and Complexity, 2003","DOI":"10.1007\/3-540-44849-7_18"},{"key":"10.1016\/j.jpdc.2009.09.010_b6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","article-title":"On the computational complexity of the rooted subtree prune and regraft distance","volume":"8","author":"Bordewich","year":"2004","journal-title":"Annals of Combinatorics"},{"key":"10.1016\/j.jpdc.2009.09.010_b7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1089\/106652700750050871","article-title":"Notung: A program for dating gene duplications and optimizing gene family trees","volume":"7","author":"Chen","year":"2000","journal-title":"Journal of Computational Biology"},{"key":"10.1016\/j.jpdc.2009.09.010_b8","series-title":"Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life","first-page":"107","article-title":"Tangled tales from multiple markers: Reconciling conflict between phylogenies to build molecular supertrees","author":"Cotton","year":"2004"},{"key":"10.1016\/j.jpdc.2009.09.010_b9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.compbiolchem.2005.06.003","article-title":"Reconstruction of large phylogenetic trees: A parallel approach","volume":"29","author":"Du","year":"2005","journal-title":"Computational Biology and Chemistry"},{"key":"10.1016\/j.jpdc.2009.09.010_b10","unstructured":"O. Eulenstein, Predictions of gene-duplications and their phylogenetic development, Ph.D. Dissertation, University of Bonn, Germany, 1998, gMD Research Series No. 20\/1998, ISSN: 1435-2699"},{"key":"10.1016\/j.jpdc.2009.09.010_b11","doi-asserted-by":"crossref","unstructured":"M. Fellows, M. Hallett, C. Korostensky, U. Stege, Analogs & duals of the mast problem for sequences & trees, in: European Symposium on Algorithms, ESA, 1998, pp. 103\u2013114","DOI":"10.1007\/3-540-68530-8_9"},{"key":"10.1016\/j.jpdc.2009.09.010_b12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/2412519","article-title":"Fitting the gene lineage into its species lineage. A parsimony strategy illustrated by cladograms constructed from globin sequences","volume":"28","author":"Goodman","year":"1979","journal-title":"Systematic Zoology"},{"key":"10.1016\/j.jpdc.2009.09.010_b13","doi-asserted-by":"crossref","unstructured":"P. G\u00f3recki, J. Tiuryn, On the structure of reconciliations, in: RECOMB Comparative Genomics Workshop, 2004","DOI":"10.1007\/978-3-540-32290-0_4"},{"issue":"2","key":"10.1016\/j.jpdc.2009.09.010_b14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/mpev.1996.0071","article-title":"Reconstruction of ancient molecular phylogeny","volume":"6","author":"Guig\u00f3","year":"1996","journal-title":"Molecular Phylogenetics and Evolution"},{"key":"10.1016\/j.jpdc.2009.09.010_b15","doi-asserted-by":"crossref","unstructured":"M.T. Hallett, J. Lagergren, New algorithms for the duplication-loss model, in: RECOMB, 2000, pp. 138\u2013146. [Online]. Available: citeseer.nj.nec.com\/article\/hallett99new.html","DOI":"10.1145\/332306.332359"},{"issue":"2","key":"10.1016\/j.jpdc.2009.09.010_b16","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/j.jpdc.2009.09.010_b17","doi-asserted-by":"crossref","unstructured":"B. Ma, M. Li, L. Zhang, On reconstructing species trees from gene trees in term of duplications and losses, in: RECOMB, 1998, pp. 182\u2013191","DOI":"10.1145\/279069.279113"},{"issue":"4","key":"10.1016\/j.jpdc.2009.09.010_b18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1089\/cmb.1995.2.493","article-title":"A biology consistent model for comparing molecular phylogenies","volume":"2","author":"Mirkin","year":"1995","journal-title":"Journal of Computational Biology"},{"issue":"9","key":"10.1016\/j.jpdc.2009.09.010_b19","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1093\/bioinformatics\/14.9.819","article-title":"GeneTree: Comparing gene and species phylogenies using reconciled trees","volume":"14","author":"Page","year":"1998","journal-title":"Bioinformatics"},{"key":"10.1016\/j.jpdc.2009.09.010_b20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/mpev.1999.0676","article-title":"Extracting species trees from complex gene trees: Reconciled trees and vertebrate phylogeny","volume":"14","author":"Page","year":"2000","journal-title":"Molecular Phylogenetics and Evolution"},{"issue":"1","key":"10.1016\/j.jpdc.2009.09.010_b21","first-page":"58","article-title":"Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas","volume":"43","author":"Page","year":"1994","journal-title":"Systematic Biology"},{"key":"10.1016\/j.jpdc.2009.09.010_b22","unstructured":"R.D.M. Page, GeneTree, http:\/\/taxonomy.zoology.gla.ac.uk\/rod\/genetree\/genetree.html"},{"key":"10.1016\/j.jpdc.2009.09.010_b23","unstructured":"R.D.M. Page, J. Cotton, Vertebrate phylogenomics: Reconciled trees and gene duplications, in: Pacific Symposium on Biocomputing, 2002, pp. 536\u2013547"},{"key":"10.1016\/j.jpdc.2009.09.010_b24","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1006\/mpev.1997.0434","article-title":"Inferring species trees from gene trees: A phylogenetic analysis of the elapidae (serpentes) based on the amino acid sequences of venom proteins","volume":"8","author":"Slowinski","year":"1997","journal-title":"Molecular Phylogenetics and Evolution"},{"key":"10.1016\/j.jpdc.2009.09.010_b25","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1002\/cpe.954","article-title":"Raxml-ii: A program for sequential, parallel & distributed inference of large phylogenetic trees","volume":"17","author":"Stamatakis","year":"2003","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"10.1016\/j.jpdc.2009.09.010_b26","doi-asserted-by":"crossref","unstructured":"U. Stege, Gene trees and species trees: The gene-duplication problem in fixed-parameter tractable, in: WADS, 1999, pp. 288\u2013293","DOI":"10.1007\/3-540-48447-7_29"},{"issue":"2","key":"10.1016\/j.jpdc.2009.09.010_b27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1089\/cmb.1997.4.177","article-title":"On a Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies","volume":"4","author":"Zhang","year":"1997","journal-title":"Journal of Computational Biology"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731509001828?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731509001828?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:50:11Z","timestamp":1558579811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731509001828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["S0743731509001828"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2009.09.010","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}