{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:00:12Z","timestamp":1765544412821},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T00:00:00Z","timestamp":1333584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s11227-012-0751-4","type":"journal-article","created":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T10:00:40Z","timestamp":1333533640000},"page":"69-78","source":"Crossref","is-referenced-by-count":4,"title":["Performance analysis of computational approaches to solve Multiple Sequence Alignment"],"prefix":"10.1007","volume":"64","author":[{"given":"Alberto","family":"Monta\u00f1ola","sequence":"first","affiliation":[]},{"given":"Concepci\u00f3","family":"Roig","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Guirado","sequence":"additional","affiliation":[]},{"given":"Porfidio","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Cedric","family":"Notredame","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"issue":"5","key":"751_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/MC.2005.160","volume":"38","author":"D Geer","year":"2005","unstructured":"Geer D (2005) Chip makers turn to multicore processors. Computer 38(5):11. doi: 10.1109\/MC.2005.160","journal-title":"Computer"},{"issue":"5","key":"751_CR2","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1093\/nar\/gkh340","volume":"32","author":"RC Edgar","year":"2004","unstructured":"Edgar RC (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 32(5):1792\u20131797","journal-title":"Nucleic Acids Res"},{"issue":"4","key":"751_CR3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1093\/bib\/bbn013","volume":"9","author":"K Katoh","year":"2008","unstructured":"Katoh K, Toh H (2008) Recent developments in the MAFFT multiple sequence alignment program. Brief Bioinform 9(4):286\u2013298","journal-title":"Brief Bioinform"},{"issue":"21","key":"751_CR4","doi-asserted-by":"crossref","first-page":"2947","DOI":"10.1093\/bioinformatics\/btm404","volume":"23","author":"MA Larkin","year":"2007","unstructured":"Larkin MA, Blackshields G, Brown NP, Chenna R, McGettigan PA, McWillian H, Valentin F, Wallace IM, Wilm A, Lopez R, Thompson JD, Gibson TJ, Higgins DG (2007) ClustalW and ClustalX version\u00a02. Bioinformatics 23(21):2947\u20132948","journal-title":"Bioinformatics"},{"issue":"1","key":"751_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","volume":"302","author":"C Notredame","year":"2000","unstructured":"Notredame C, Higgins DG, Heringa J (2000) T-Coffee: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 302(1):205\u2013217. PMID: 10964570 [PubMed\u2014indexed for MEDLINE]","journal-title":"J Mol Biol"},{"key":"751_CR6","first-page":"248","volume-title":"Proc. of ISCA PDCS-2007","author":"J Zola","year":"2007","unstructured":"Zola J, Yang X, Rospondek S, Aluru S (2007) Parallel T-Coffee: a parallel multiple sequence aligner. In: Proc. of ISCA PDCS-2007, pp\u00a0248\u2013253"},{"key":"751_CR7","unstructured":"Naranjo Y (2009) Multiple sequence alignment with T-Coffee: a parallel approach. Master thesis, UAB"},{"issue":"1","key":"751_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1093\/bioinformatics\/15.1.87","volume":"15","author":"JD Thompson","year":"1999","unstructured":"Thompson JD, Plewniak F, Poch O (1999) BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15(1):87\u201388","journal-title":"Bioinformatics"},{"key":"751_CR9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jpdc.1999.1578","volume":"59","author":"YK Kwok","year":"1999","unstructured":"Kwok YK, Ahmad I (1999) Benchmarking and comparison of the task graph scheduling algorithms. J\u00a0Parallel Distrib Comput 59:381\u2013422","journal-title":"J\u00a0Parallel Distrib Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0751-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-012-0751-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0751-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:06Z","timestamp":1559384646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-012-0751-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,5]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s11227-012-0751-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,5]]}}}