{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T04:15:02Z","timestamp":1728360902190},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T00:00:00Z","timestamp":1098921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0\/"},{"start":{"date-parts":[[2004,10,28]],"date-time":"2004-10-28T00:00:00Z","timestamp":1098921600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                        <jats:title>Background<\/jats:title>\n                        <jats:p>Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a useful source of functional and structural information about these sequences. Using software such as the basic local alignment search tool (BLAST) or HMMPFAM to identify statistically significant matches between newly sequenced segments of genetic material and those in databases is an important task for most molecular biologists. Searching algorithms are intrinsically slow and data-intensive, especially in light of the rapid growth of biological sequence databases due to the emergence of high throughput DNA sequencing techniques. Thus, traditional bioinformatics tools are impractical on PCs and even on dedicated UNIX servers. To take advantage of larger databases and more reliable methods, high performance computation becomes necessary.<\/jats:p>\n                     <\/jats:sec><jats:sec>\n                        <jats:title>Results<\/jats:title>\n                        <jats:p>We describe the implementation of SS-Wrapper (Similarity Search Wrapper), a package of wrapper applications that can parallelize similarity search applications on a Linux cluster. Our wrapper utilizes a query segmentation-search (QS-search) approach to parallelize sequence database search applications. It takes into consideration load balancing between each node on the cluster to maximize resource usage. QS-search is designed to wrap many different search tools, such as BLAST and HMMPFAM using the same interface. This implementation does not alter the original program, so newly obtained programs and program updates should be accommodated easily. Benchmark experiments using QS-search to optimize BLAST and HMMPFAM showed that QS-search accelerated the performance of these programs almost linearly in proportion to the number of CPUs used. We have also implemented a wrapper that utilizes a database segmentation approach (DS-BLAST) that provides a complementary solution for BLAST searches when the database is too large to fit into the memory of a single node.<\/jats:p>\n                     <\/jats:sec><jats:sec>\n                        <jats:title>Conclusions<\/jats:title>\n                        <jats:p>Used together, QS-search and DS-BLAST provide a flexible solution to adapt sequential similarity searching applications in high performance computing environments. Their ease of use and their ability to wrap a variety of database search programs provide an analytical architecture to assist both the seasoned bioinformaticist and the wet-bench biologist.<\/jats:p>\n                     <\/jats:sec>","DOI":"10.1186\/1471-2105-5-171","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T07:24:05Z","timestamp":1099380245000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters"],"prefix":"10.1186","volume":"5","author":[{"given":"Chunlin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elliot J","family":"Lefkowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,10,28]]},"reference":[{"key":"287_CR1","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1017\/CBO9780511574931.013","volume-title":"Algorithm on Strings, Trees, and Sequences","author":"Dan Gusfield","year":"1997","unstructured":"Gusfield Dan: Algorithm on Strings, Trees, and Sequences. New York, Cambridge University Press; 1997:212."},{"key":"287_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/nar\/gkg057","volume":"31","author":"DA Benson","year":"2003","unstructured":"Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Wheeler DL: GenBank.\n                           Nucleic Acids Res 2003, 31: 23\u201327. 10.1093\/nar\/gkg057","journal-title":"Nucleic Acids Res"},{"key":"287_CR3","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"SF Altschul","year":"1997","unstructured":"Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.\n                           Nucleic Acids Res 1997, 25: 3389\u20133402. 10.1093\/nar\/25.17.3389","journal-title":"Nucleic Acids Res"},{"key":"287_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool.\n                           J Mol Biol 1990, 215: 403\u2013410. 10.1006\/jmbi.1990.9999","journal-title":"J Mol Biol"},{"key":"287_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0076-6879(90)83007-V","volume":"183","author":"WR Pearson","year":"1990","unstructured":"Pearson WR: Rapid and sensitive sequence comparison with FASTP and FASTA.\n                           Methods Enzymol 1990, 183: 63\u201398.","journal-title":"Methods Enzymol"},{"key":"287_CR6","unstructured":"Barton GJ: User Guide to SCANPS -- Scan Protein Sequence Database Version 2.3.9.[http:\/\/www.ebi.ac.uk\/scanps\/scanps_manual.pdf]"},{"key":"287_CR7","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1002\/prot.10373","volume":"52","author":"B Qian","year":"2003","unstructured":"Qian B, Goldstein RA: Detecting distant homologs using phylogenetic tree-based HMMs.\n                           Proteins 2003, 52: 446\u2013453. 10.1002\/prot.10373","journal-title":"Proteins"},{"key":"287_CR8","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1093\/nar\/30.1.276","volume":"30","author":"A Bateman","year":"2002","unstructured":"Bateman A, Birney E, Cerruti L, Durbin R, Etwiller L, Eddy SR, Griffiths-Jones S, Howe KL, Marshall M, Sonnhammer EL: The Pfam protein families database.\n                           Nucleic Acids Res 2002, 30: 276\u2013280. 10.1093\/nar\/30.1.276","journal-title":"Nucleic Acids Res"},{"key":"287_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"Jr. G. D. Forney","year":"1973","unstructured":"G. D. Forney Jr.: The Viterbi algorithm.\n                           Proc IEEE 1973, 61: 268\u2013278.","journal-title":"Proc IEEE"},{"key":"287_CR10","volume-title":"High Performance Cluster Computing: Architectures and Systems","author":"Rajkumar Buyya","year":"1999","unstructured":"Buyya Rajkumar: High Performance Cluster Computing: Architectures and Systems. Upper Saddle River, N.J., Prentice Hall PTR; 1999."},{"key":"287_CR11","volume-title":"ClusterWorld Conference and Expo","author":"Aaron E. Darling","year":"2003","unstructured":"Darling Aaron E., Carey Lucas, Feng Wu-chun: The Design, Implementation, and Evaluation of mpiBLAST. In ClusterWorld Conference and Expo. San Jose, CA; 2003."},{"key":"287_CR12","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1093\/bioinformatics\/18.5.765","volume":"18","author":"JD Grant","year":"2002","unstructured":"Grant JD, Dunbrack RL, Manion FJ, Ochs MF: BeoBLAST: distributed BLAST and PSI-BLAST on a Beowulf cluster.\n                           Bioinformatics 2002, 18: 765\u2013766. 10.1093\/bioinformatics\/18.5.765","journal-title":"Bioinformatics"},{"key":"287_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1093\/bioinformatics\/btg007","volume":"19","author":"K Hokamp","year":"2003","unstructured":"Hokamp K, Shields DC, Wolfe KH, Caffrey DR: Wrapping up BLAST and other applications for use on Unix clusters.\n                           Bioinformatics 2003, 19: 441\u2013442. 10.1093\/bioinformatics\/btg007","journal-title":"Bioinformatics"},{"key":"287_CR14","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1093\/bioinformatics\/btg250","volume":"19","author":"DR Mathog","year":"2003","unstructured":"Mathog DR: Parallel BLAST on split databases.\n                           Bioinformatics 2003, 19: 1865\u20131866. 10.1093\/bioinformatics\/btg250","journal-title":"Bioinformatics"},{"key":"287_CR15","volume-title":"Using MPI: Portable Parallel Programming with the Message Passing Interface","author":"W Gropp","year":"1999","unstructured":"Gropp W, Lusk E, Skjellum A: Using MPI: Portable Parallel Programming with the Message Passing Interface. Cambridge, MA, MIT Press; 1999."},{"key":"287_CR16","unstructured":"Open Source Initiative [http:\/\/www.opensource.org\/licenses\/artistic-license.php]."},{"key":"287_CR17","unstructured":"FTP site [ftp:\/\/ftp.genome.uab.edu]."},{"key":"287_CR18","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1073\/pnas.87.6.2264","volume":"87","author":"S Karlin","year":"1990","unstructured":"Karlin S, Altschul SF: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.\n                           Proc Natl Acad Sci U S A 1990, 87: 2264\u20132268.","journal-title":"Proc Natl Acad Sci U S A"},{"key":"287_CR19","unstructured":"Enabling Technology Laboratory [http:\/\/www.eng.uab.edu\/me\/ETLab\/]."},{"key":"287_CR20","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1093\/bioinformatics\/16.6.564","volume":"16","author":"R Clifford","year":"2000","unstructured":"Clifford R, Mackey AJ: Disperse: a simple and efficient approach to parallel database searching.\n                           Bioinformatics 2000, 16: 564\u2013565. 10.1093\/bioinformatics\/16.6.564","journal-title":"Bioinformatics"},{"key":"287_CR21","volume-title":"IPDPS 2002 Workshops","author":"RD Bjornson","year":"2002","unstructured":"Bjornson RD, Sherman AH, Weston SB, Willard N, Wang J: TurboBLAST\u00ae: A Parallel Implementation of BLAST Built on the TurboHub.\n                           IPDPS 2002 Workshops 2002."},{"key":"287_CR22","doi-asserted-by":"crossref","unstructured":"Berman Fran, Fox Geoffrey and Hey Anthony J G (Eds): Grid Computing : Making the Global Infrastructure a Reality In Wiley series in communications networking & distributed systems. New York, Wiley; 2003:xlvi, 1012 p..","DOI":"10.1002\/0470867167"},{"key":"287_CR23","unstructured":"LAM\/MPI [http:\/\/www.lam-mpi.org\/]."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-5-171.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/1471-2105-5-171\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-5-171.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T12:20:18Z","timestamp":1728303618000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-5-171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,28]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2004,12]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-5-171","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2004,10,28]]},"assertion":[{"value":"1 July 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2004","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2004","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"171"}}