SANS: High-throughput retrieval of protein sequences allowing 50% mismatches

Bioinformatics

Volumn 28, Issue 18, 2012, Pages

  Koskinen, J Patrik ^a   Holm, Liisa ^a,b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIAL PROTEIN;

ALGORITHM; ARTICLE; CHEMISTRY; COMPUTER PROGRAM; GENETICS; GENOME; METAGENOME; METHODOLOGY; PROTEIN DATABASE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SEQUENCE HOMOLOGY;

ALGORITHMS; BACTERIAL PROTEINS; DATABASES, PROTEIN; GENOME; METAGENOME; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, PROTEIN; SEQUENCE HOMOLOGY, AMINO ACID; SOFTWARE;

EID: 84866458775     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts417     Document Type: Article

References (21)

1. Altschul,S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
2. Bejerano,G. and Yona,G. (1999). Modeling protein families using probabilistic suffix trees. In: The Proceedings of RECOMB 1999,ACM Press, Lyon, France, pp. 15-24.
3. Burkhard,S., et al. (1999) q-gram based database searching using a suffix array (QUASAR).RECOMB'99 Proceedings of the third annual international conference on Computational molecular biology, Lyon, France, pp. 77-83.
4. Califano,A. and Rigoutsos,I. (1993) FLASH: A fast look-up algorithm for string homology. In Hunter,L. et al. (eds). In: Proceedings of the first International Conference on Intelligent Systems for Molecular Biology, Bethesda, Maryland, USA, pp. 56-64.
5. Devos,D. and Valencia,A (2000) Practical limits of function prediction. Proteins, 41, 98-107.
6. Edgar,R.C. (2010) Search and clustering orders of magnitude faster than BLAST. Bioinformatics, 26, 2460-2461.
7. Friedberg,I. (2006) Automated protein function prediction-the genomic challenge. Brief. Bioinform., 7, 225-242.
8. Gonnet,G.H. et al. (1992) Exhaustive matching of the entire protein sequence database. Science, 256, 1443-1445.
9. Holm,L. and Sander,C. (1998) Removing near-neighbour redundancy from large protein data sets. Bioinformatics 14, 423-429.
10. Ilie,L. and Ilie,S. (2007) Multiple spaced seeds for homology search. Bioinformatics, 22, 2969-2977.
11. Kankainen,M. et al. (2012) BLANNOTATOR: enhanced homology-based function prediction of bacterial proteins. BMC Bioinformatics, 13, 33.
12. Lee,D. et al. (2007) Predicting protein function from sequence and structure. Nat. Rev. Mol. Cell Biol., 8, 995-1005.
13. Li,W. and Godzik,A. (2006) Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences. Bioinformatics, 22, 1658-1659.
14. Ma,B. et al. (2002) PatternHunter: faster and more sensitive HomologySearch. Bioinformatics, 18, 440-445.
15. Mak,D.Y.F. and Benson,G. (2009) All hits all the time: parameter-free calculation of spaced seed sensitivity. Bioinformatics, 25, 302-308.
16. Nong,G. et al. (2009) Linear Suffix Array Construction by Almost Pure Induced-Sorting. DCC, Snowbird, Utah, USA, pp. 193-202.
17. Park,J. et al. (2000) RSDB: representative protein sequence databases have high information content. Bioinformatics, 16, 458-464.
18. Pearson,W.R. (1991) Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics, 11, 635-650.
19. Punta,M. et al. (2012) The Pfam protein families database Nucleic Acids Res., 40, D290-D301.
20. Quevillon,E. et al. (2005) InterProScan: protein domains identifier. Nucleic Acids Res., 33, W116-W120.
21. Rost,B. (2002) Enzyme function less conserved than anticipated. J. Mol. Biol., 318, 595-608.