Searching for a family of orphan sequences with SAMBA, a parallel hardware dedicated to biological applications
A significant proportion of coding sequences or open reading frames discovered in the course of sequencing projects do not show any similarity with other sequences deposited with the protein databanks. In such cases the search for similarities must be performed with as many comparison algorithms as...
Saved in:
Published in: | Biochimie Vol. 78; no. 5; pp. 311 - 314 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
France
Elsevier Masson SAS
1996
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A significant proportion of coding sequences or open reading frames discovered in the course of sequencing projects do not show any similarity with other sequences deposited with the protein databanks. In such cases the search for similarities must be performed with as many comparison algorithms as possible, so as to increase the chance of finding weak relationships. A specialised parallel hardware (SAMBA) implementing the Smith & Waterman algorithm has been developed at the ‘Institut de Recherche en Informatique et Systèmes Aléatoires’ (IRISA). It makes it possible to scan protein databanks at a speed comparable with that of BLAST or FASTA. We report here a study performed with SAMBA on 814 orphan sequences from
S cerevisiae and compare the results with those from BLAST and FASTA. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
ISSN: | 0300-9084 1638-6183 |
DOI: | 10.1016/0300-9084(96)84762-6 |