Significant speedup of database searches with HMMs by search space reduction with PSSM family models Export

@article{citeulike:5943325, abstract = {Motivation: Profile hidden Markov models (pHMMs) are currently the most popular modeling concept for protein families. They provide sensitive family descriptors, and sequence database searching with pHMMs has become a standard task in today's genome annotation pipelines. On the downside, searching with pHMMs is computationally expensive. Results: We propose a new method for efficient protein family classification and for speeding up database searches with pHMMs as is necessary for large-scale analysis scenarios. We employ simpler models of protein families called position-specific scoring matrices family models (PSSM-FMs). For fast database search, we combine full-text indexing, efficient exact p-value computation of PSSM match scores and fast fragment chaining. The resulting method is well suited to prefilter the set of sequences to be searched for subsequent database searches with pHMMs. We achieved a classification performance only marginally inferior to hmmsearch, yet, results could be obtained in a fraction of runtime with a speedup of >64-fold. In experiments addressing the method's ability to prefilter the sequence space for subsequent database searches with pHMMs, our method reduces the number of sequences to be searched with hmmsearch to only 0.80\% of all sequences. The filter is very fast and leads to a total speedup of factor 43 over the unfiltered search, while retaining >99.5\% of the original results. In a lossless filter setup for hmmsearch on UniProtKB/Swiss-Prot, we observed a speedup of factor 92. Availability: The presented algorithms are implemented in the program PoSSuMsearch2, available for download at http://bibiserv.techfak.uni-bielefeld.de/possumsearch2/. Contact: beckstette@zbh.uni-hamburg.de Supplementary information: Supplementary data are available at Bioinformatics online. 10.1093/bioinformatics/btp593}, author = {Beckstette, Michael and Homann, Robert and Giegerich, Robert and Kurtz, Stefan}, citeulike-article-id = {5943325}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/btp593}, citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/content/btp593v1/.abstract}, citeulike-linkout-2 = {http://bioinformatics.oxfordjournals.org/content/btp593v1/.full.pdf}, citeulike-linkout-3 = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/25/24/3251}, citeulike-linkout-4 = {http://view.ncbi.nlm.nih.gov/pubmed/19828575}, citeulike-linkout-5 = {http://www.hubmed.org/display.cgi?uids=19828575}, day = {15}, doi = {10.1093/bioinformatics/btp593}, issn = {1460-2059}, journal = {Bioinformatics}, keywords = {bioinformatics, data, data\_mining, database, database\_search, hmms, software}, month = {December}, number = {24}, pages = {3251--3258}, posted-at = {2009-10-20 17:51:27}, priority = {2}, title = {Significant speedup of database searches with HMMs by search space reduction with PSSM family models}, url = {http://dx.doi.org/10.1093/bioinformatics/btp593}, volume = {25}, year = {2009} }

TY - JOUR ID - citeulike:5943325 L3 - citeulike-article-id:5943325 N2 - Motivation: Profile hidden Markov models (pHMMs) are currently the most popular modeling concept for protein families. They provide sensitive family descriptors, and sequence database searching with pHMMs has become a standard task in today's genome annotation pipelines. On the downside, searching with pHMMs is computationally expensive. Results: We propose a new method for efficient protein family classification and for speeding up database searches with pHMMs as is necessary for large-scale analysis scenarios. We employ simpler models of protein families called position-specific scoring matrices family models (PSSM-FMs). For fast database search, we combine full-text indexing, efficient exact p-value computation of PSSM match scores and fast fragment chaining. The resulting method is well suited to prefilter the set of sequences to be searched for subsequent database searches with pHMMs. We achieved a classification performance only marginally inferior to hmmsearch, yet, results could be obtained in a fraction of runtime with a speedup of >64-fold. In experiments addressing the method's ability to prefilter the sequence space for subsequent database searches with pHMMs, our method reduces the number of sequences to be searched with hmmsearch to only 0.80% of all sequences. The filter is very fast and leads to a total speedup of factor 43 over the unfiltered search, while retaining >99.5% of the original results. In a lossless filter setup for hmmsearch on UniProtKB/Swiss-Prot, we observed a speedup of factor 92. Availability: The presented algorithms are implemented in the program PoSSuMsearch2, available for download at http://bibiserv.techfak.uni-bielefeld.de/possumsearch2/. Contact: beckstette@zbh.uni-hamburg.de Supplementary information: Supplementary data are available at Bioinformatics online. 10.1093/bioinformatics/btp593 IS - 24 JF - Bioinformatics SN - 1460-2059 EP - 3258 TI - Significant speedup of database searches with HMMs by search space reduction with PSSM family models VL - 25 SP - 3251 KW - bioinformatics KW - data KW - data_mining KW - database KW - database_search KW - hmms KW - software AU - Beckstette, Michael AU - Homann, Robert AU - Giegerich, Robert AU - Kurtz, Stefan PY - 2009/12/15/ UR - http://dx.doi.org/10.1093/bioinformatics/btp593 ER -