{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:50Z","timestamp":1725550070974},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290315"},{"type":"electronic","value":"9783540320791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_88","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:59:18Z","timestamp":1128434358000},"page":"776-785","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Divide-and-Conquer Phylogeny Reconstruction by Maximum Likelihood"],"prefix":"10.1007","author":[{"given":"Z.","family":"Du","sequence":"first","affiliation":[]},{"given":"A.","family":"Stamatakis","sequence":"additional","affiliation":[]},{"given":"F.","family":"Lin","sequence":"additional","affiliation":[]},{"given":"U.","family":"Roshan","sequence":"additional","affiliation":[]},{"given":"L.","family":"Nakhleh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"88_CR1","unstructured":"Additional on-line material, http:\/\/www.ics.forth.gr\/~stamatak"},{"key":"88_CR2","doi-asserted-by":"crossref","first-page":"1717","DOI":"10.1093\/oxfordjournals.molbev.a003994","volume":"19","author":"M.J. Brauer","year":"2002","unstructured":"Brauer, M.J., Holder, M.T., Dries, L.A., Zwickl, D.J., Lewis, P.O., Hillis, D.M.: Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference. Molecular Biology and Evolution\u00a019, 1717\u20131726 (2002)","journal-title":"Molecular Biology and Evolution"},{"key":"88_CR3","doi-asserted-by":"crossref","unstructured":"Chor, B., Tuller, T.: Maximum likelihood of evolutionary trees is hard. In: Proc. of RECOMB (2005)","DOI":"10.1007\/11415770_23"},{"key":"88_CR4","doi-asserted-by":"crossref","unstructured":"Coarfa, C., Dotsenko, Y., Mellor-Crummey, J., Nakhleh, L., Roshan, U.: Prec-i-dcm3: A parallel framework for fast and accurate large scale phylogeny reconstruction. In: Proc. of HiPCoMP (2005) (to be published)","DOI":"10.1109\/ICPADS.2005.240"},{"issue":"5","key":"88_CR5","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1093\/nar\/gkh340","volume":"32","author":"R.C. Edgar","year":"2004","unstructured":"Edgar, R.C.: Muscle: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research\u00a032(5), 1792\u20131797 (2004)","journal-title":"Nucleic Acids Research"},{"key":"88_CR6","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J. Felsenstein","year":"1981","unstructured":"Felsenstein, J.: Evolutionary trees from DNA sequences: A maximum likelihood approach. Journal of Molecular Evolution\u00a017, 368\u2013376 (1981)","journal-title":"Journal of Molecular Evolution"},{"issue":"5","key":"88_CR7","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1080\/10635150390235520","volume":"52","author":"S. Guindon","year":"2003","unstructured":"Guindon, S., Gascuel, O.: A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol.\u00a052(5), 696\u2013704 (2003)","journal-title":"Syst. Biol."},{"key":"88_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1089\/106652799318337","volume":"6","author":"D. Huson","year":"1999","unstructured":"Huson, D., Nettles, S., Warnow, T.: Disk-covering, a fast-converging method for phylogenetic tree reconstruction. J. Comp. Biol.\u00a06, 369\u2013386 (1999)","journal-title":"J. Comp. Biol."},{"key":"88_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/2406441","volume":"19","author":"J. Camin","year":"1965","unstructured":"Camin, J., Sokal, R.: A method for deducing branching sequences in phylogeny. Evolution\u00a019, 311\u2013326 (1965)","journal-title":"Evolution"},{"key":"88_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF00985205","volume":"213","author":"M. Kallerjo","year":"1998","unstructured":"Kallerjo, M., Farris, J.S., Chase, M.W., Bremer, B., Fay, M.F.: Simultaneous parsimony jackknife analysis of 2538 rbcL DNA sequences reveals support for major clades of green plants, land plants, seed plants, and flowering plants. Plant. Syst. Evol.\u00a0213, 259\u2013287 (1998)","journal-title":"Plant. Syst. Evol."},{"issue":"7","key":"88_CR11","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1093\/bioinformatics\/bti100","volume":"21","author":"T.M. Keane","year":"2005","unstructured":"Keane, T.M., Naughton, T.J., Travers, S.A.A., McInerney, J.O., McCormack, G.P.: Dprml: Distributed phylogeny reconstruction by maximum likelihood. Bioinformatics\u00a021(7), 969\u2013974 (2005)","journal-title":"Bioinformatics"},{"issue":"2","key":"88_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/prot.20321","volume":"58","author":"D. La","year":"2005","unstructured":"La, D., Sutch, B., Livesay, D.R.: Predicting protein functional sites with phylogenetic motifs. Prot.: Struct., Funct., and Bioinf.\u00a058(2), 309\u2013320 (2005)","journal-title":"Prot.: Struct., Funct., and Bioinf."},{"key":"88_CR13","unstructured":"Le, S.V., Schmidt, H.A., Haeseler, A.v.: Phynav: A novel approach to reconstruct large phylogenies. In: Proc. of GfKl conference (2004)"},{"key":"88_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1093\/nar\/28.1.173","volume":"28","author":"B. Maidak","year":"2000","unstructured":"Maidak, B.: The RDP (ribosomal database project) continues. Nucleic Acids Research\u00a028, 173\u2013174 (2000)","journal-title":"Nucleic Acids Research"},{"key":"88_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-45784-4_26","volume-title":"Algorithms in Bioinformatics","author":"B.M.E. Moret","year":"2002","unstructured":"Moret, B.M.E., Roshan, U., Warnow, T.J.: Sequence-length requirements for phylogenetic methods. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 343\u2013356. Springer, Heidelberg (2002)"},{"issue":"3","key":"88_CR16","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1093\/sysbio\/46.3.554","volume":"46","author":"K. Rice","year":"1997","unstructured":"Rice, K., Donoghue, M., Olmstead, R.: Analyzing large datasets: rbcL 500 revisited. Systematic Biology\u00a046(3), 554\u2013563 (1997)","journal-title":"Systematic Biology"},{"key":"88_CR17","doi-asserted-by":"crossref","unstructured":"Roshan, U., Moret, B.M.E., Warnow, T., Williams, T.L.: Rec-i-dcm3: a fast algorithmic technique for reconstructing large phylogenetic trees. In: Proc. of CSB 2004, Stanford, California, USA (2004)","DOI":"10.1109\/CSB.2004.1332422"},{"key":"88_CR18","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution\u00a04, 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolution"},{"key":"88_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1093\/protein\/7.3.349","volume":"7","author":"I.N. Shindyalov","year":"1994","unstructured":"Shindyalov, I.N., Kolchanov, N.A., Sander, C.: Can three-dimensional contacts in protein structures be predicted by analysis of correlated mutations? Prot. Engng.\u00a07, 349\u2013358 (1994)","journal-title":"Prot. Engng."},{"issue":"4","key":"88_CR20","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1093\/bioinformatics\/bti191","volume":"21","author":"A. Stamatakis","year":"2005","unstructured":"Stamatakis, A., Ludwig, T., Meier, H.: Raxml-iii: A fast program for maximum likelihood-based inference of large phylogenetic trees. Bioinformatics\u00a021(4), 456\u2013463 (2005)","journal-title":"Bioinformatics"},{"key":"88_CR21","doi-asserted-by":"crossref","unstructured":"Stamatakis, A., Ludwig, T., Meier, H.: Parallel inference of a 10.000-taxon phylogeny with maximum likelihood. In: Proc. of Euro-Par 2004, pp. 997\u20131004 (2004)","DOI":"10.1007\/978-3-540-27866-5_134"},{"key":"88_CR22","doi-asserted-by":"crossref","unstructured":"Stewart, C., Hart, D., Berry, D., Olsen, G., Wernert, E., Fischer, W.: Parallel implementation and performance of fastdnaml - a program for maximum likelihood phylogenetic inference. In: Proc. of SC (2001)","DOI":"10.1145\/582034.582054"},{"key":"88_CR23","unstructured":"Williams, T.L.: The relationship between maximum parsimony scores and phylogenetic tree topologies. In: Tech. Report, TR-CS-2004-04, Department of Computer Science, The University of New Mexico (2004)"},{"key":"88_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/nar\/30.1.183","volume":"30","author":"J. Wuyts","year":"2002","unstructured":"Wuyts, J., Van de Peer, Y., Winkelmans, T., De Wachter, R.: The European database on small subunit ribosomal RNA. Nucl. Acids Res.\u00a030, 183\u2013185 (2002)","journal-title":"Nucl. Acids Res."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T01:12:57Z","timestamp":1586481177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11557654_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}