{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T18:10:13Z","timestamp":1736014213858,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_102","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:59:18Z","timestamp":1128434358000},"page":"910-915","source":"Crossref","is-referenced-by-count":0,"title":["Parallelization of Multiple Genome Alignment"],"prefix":"10.1007","author":[{"given":"Yiming","family":"Li","sequence":"first","affiliation":[]},{"given":"Cheng-Kai","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"102_CR1","first-page":"115","volume":"5","author":"M. Vingron","year":"1989","unstructured":"Vingron, M., Argos, P.: A fast and sensitive multiple sequence alignment algorithm. Comput. Appl. Biosci.\u00a05, 115\u2013121 (1989)","journal-title":"Comput. Appl. Biosci."},{"key":"102_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1089\/cmb.1995.2.459","volume":"2","author":"S.K. Gupta","year":"1995","unstructured":"Gupta, S.K., Kececioglu, J.D., Sch\u00e4ffer, A.A.: Improving the Practical Time and Space Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment. J. Comput. Bio.\u00a02, 459\u2013472 (1995)","journal-title":"J. Comput. Bio."},{"key":"102_CR3","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/3477.650054","volume":"27","author":"C. Zhang","year":"1997","unstructured":"Zhang, C., Wong, A.K.C.: Toward efficient multiple molecular sequence alignment: a system of genetic algorithm and dynamic programming. IEEE Trans. Systems, Man and Cybernetics, Part B.\u00a027, 918\u2013932 (1997)","journal-title":"IEEE Trans. Systems, Man and Cybernetics, Part B."},{"key":"102_CR4","doi-asserted-by":"crossref","unstructured":"Luo, J., Ahmad, I., Ahmed, M., Paul, R.: Parallel Multiple Sequence Alignment with Dynamic Scheduling. In: IEEE Int. Conf. Info. Tech.: Coding and Computing, vol.\u00a01, pp. 8\u201313 (2005)","DOI":"10.1109\/ITCC.2005.223"},{"key":"102_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0378-1119(88)90330-7","volume":"73","author":"D.G. Higgins","year":"1988","unstructured":"Higgins, D.G., Sharp, P.M.: CLUSTAL: a Package for Performing Multiple Sequence Alignment in a Microcomputer. Gene.\u00a073, 237\u2013244 (1988)","journal-title":"Gene."},{"key":"102_CR6","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1093\/bioinformatics\/18.9.1270","volume":"18","author":"J. Kleinjung","year":"2002","unstructured":"Kleinjung, J., Douglas, N., Herringa, J.: Parallelized multiple alignment. Bioinformatics\u00a018, 1270\u20131271 (2002)","journal-title":"Bioinformatics"},{"key":"102_CR7","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1093\/bioinformatics\/btg192","volume":"19","author":"K.-B. Li","year":"2003","unstructured":"Li, K.-B.: ClustalW-MPI: ClustalW analysis using distributed and parallel computing. Bioinformatics\u00a019, 1585\u20131586 (2003)","journal-title":"Bioinformatics"},{"key":"102_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/s003660200011","volume":"18","author":"Y. Li","year":"2002","unstructured":"Li, Y., Sze, S.M., Chao, T.-S.: A Practical Implementation of Parallel Dynamic Load Balancing for Adaptive Computing in VLSI Device Simulation. Engineering with Computers\u00a018, 124\u2013137 (2002)","journal-title":"Engineering with Computers"},{"key":"102_CR9","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02603120","volume":"25","author":"D.F. Feng","year":"1987","unstructured":"Feng, D.F., Doolittle, R.F.: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol.\u00a025, 351\u2013360 (1987)","journal-title":"J. Mol. Evol."},{"key":"102_CR10","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. J. Mol. Evol.\u00a04, 406\u2013425 (1987)","journal-title":"J. Mol. Evol."},{"key":"102_CR11","unstructured":"National Center for Biotechnology Information. [Online]. Available: http:\/\/www.ncbi.nlm.nih.gov\/"}],"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_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T17:28:28Z","timestamp":1736011708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11557654_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}