{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:11:28Z","timestamp":1725469888896},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377832"},{"type":"electronic","value":"9783540377849"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823285_120","type":"book-chapter","created":{"date-parts":[[2006,9,5]],"date-time":"2006-09-05T18:04:04Z","timestamp":1157479444000},"page":"1138-1147","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Load Balancing and Parallel Multiple Sequence Alignment with Tree Accumulation"],"prefix":"10.1007","author":[{"given":"Guangming","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengzhong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ninghui","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"22","key":"120_CR1","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"D.T. Julie","year":"1994","unstructured":"Julie, D.T., Desmond, G.H., Toby, J.G.: Clustal W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research\u00a022(22), 4673\u20134680 (1994)","journal-title":"Nucleic Acids Research"},{"unstructured":"Henikoff, D.: Approximation Algorithms for NP-hard Problems. PWS publishers (1996)","key":"120_CR2"},{"key":"120_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02603120","volume":"25","author":"D. Feng","year":"1987","unstructured":"Feng, D., Doolittle, R.F.: Progressive sequence alignment as prerequisite to correct phylogenetic trees. Journal of Molecular Evolution\u00a025, 351\u2013360 (1987)","journal-title":"Journal of Molecular Evolution"},{"key":"120_CR4","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 Evolutoin\u00a04, 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolutoin"},{"unstructured":"Mikhailov, D., Cofer, H., Gomperts, R.: Performance optimization of ClustalW: Parallel ClustalW, HT Clustal and MULTICLUSTAL. White papers, SGI (2001)","key":"120_CR5"},{"unstructured":"Duzlevski, O.: SMP version of ClustalW 1.82, \n                    \n                      http:\/\/bioinfor.pbi.nrc.ca\/clustalw-smp","key":"120_CR6"},{"doi-asserted-by":"crossref","unstructured":"Cheetham, J.J., Dehne, F., Pitre, S., Chaplin, A.R., Tailon, P.J.: Parallel CLUSTALW for PC Clusters. In: Proceedings of International Conference on Computational Science and its Applications, Montreal, Canada, May 18-21 (2003)","key":"120_CR7","DOI":"10.1007\/3-540-44843-8_32"},{"issue":"12","key":"120_CR8","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1093\/bioinformatics\/btg192","volume":"19","author":"K. Li","year":"2003","unstructured":"Li, K.: ClustalW-MPI: Clustalw analysis using distributed and parallel computing. Bioinformatics\u00a019(12), 1585\u20131586 (2003)","journal-title":"Bioinformatics"},{"key":"120_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(94)00013-1","volume":"23","author":"J. Gibbons","year":"1994","unstructured":"Gibbons, J., Cai, W., Skillicorn, D.: Efficient parallel algorithms for tree accumulations. Sci. Comput. Programming\u00a023, 1\u201318 (1994)","journal-title":"Sci. Comput. Programming"},{"issue":"4","key":"120_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y.K. Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys\u00a031(4), 406\u2013471 (1999)","journal-title":"ACM Computing Surveys"},{"unstructured":"http:\/\/www.rcsb.org\/pdb\/","key":"120_CR11"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2006 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823285_120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:23:37Z","timestamp":1587342217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823285_120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377832","9783540377849"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11823285_120","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}