SANS: high-throughput retrieval of protein sequences allowing 50% mismatches.
| Autor: | Koskinen JP; Department of Biosciences, Division of Genetics. University of Helsinki, 00014 Helsinki, Finland., Holm L |
|---|---|
| Jazyk: | angličtina |
| Zdroj: | Bioinformatics (Oxford, England) [Bioinformatics] 2012 Sep 15; Vol. 28 (18), pp. i438-i443. |
| DOI: | 10.1093/bioinformatics/bts417 |
| Abstrakt: | Motivation: The genomic era in molecular biology has brought on a rapidly widening gap between the amount of sequence data and first-hand experimental characterization of proteins. Fortunately, the theory of evolution provides a simple solution: functional and structural information can be transferred between homologous proteins. Sequence similarity searching followed by k-nearest neighbor classification is the most widely used tool to predict the function or structure of anonymous gene products that come out of genome sequencing projects. Results: We present a novel word filter, suffix array neighborhood search (SANS), to identify protein sequence similarities in the range of 50-100% identity with sensitivity comparable to BLAST and 10 times the speed of USEARCH. In contrast to these previous approaches, the complexity of the search is proportional only to the length of the query sequence and independent of database size, enabling fast searching and functional annotation into the future despite rapidly expanding databases. Availability and Implementation: The software is freely available to non-commercial users from our website http://ekhidna.biocenter.helsinki.fi/downloads/sans. Contact: liisa.holm@helsinki.fi. |
| Databáze: | MEDLINE |
| Externí odkaz: |
|