1996
DOI: 10.1093/bioinformatics/12.3.191
|View full text |Cite
|
Sign up to set email alerts
|

BioSCAN: a network sharable computational resource for searching biosequence databases

Abstract: We describe a network sharable, interactive computational tool for rapid and sensitive search and analysis of biomolecular sequence databases such as GenBank, GenPept, Protein Identification Resource, and SWISS-PROT. The resource is accessible via the World Wide Web using popular client software such as Mosaic and Netscape. The client software is freely available on a number of computing platforms including Macintosh,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

1997
1997
2012
2012

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(22 citation statements)
references
References 12 publications
0
22
0
Order By: Relevance
“…P-NAC was the first such machine and computed edit distance over a four-character alphabet [11]. More recent examples, better tuned to the needs of computational biology, include BioScan [18], BISP [4], and SAMBA [6].…”
Section: Related Workmentioning
confidence: 99%
“…P-NAC was the first such machine and computed edit distance over a four-character alphabet [11]. More recent examples, better tuned to the needs of computational biology, include BioScan [18], BISP [4], and SAMBA [6].…”
Section: Related Workmentioning
confidence: 99%
“…However, they are limited to one single algorithm, and thus cannot supply the flexibility necessary to run a variety of algorithms required analyzing DNA, RNA, and proteins, e.g. P-NAC, SAMBA, Bioscan [11,5,17]. Reconfigurable systems are based on programmable logic such as field-programmable gate arrays (FPGAs), e.g.…”
Section: Parallel Sequence Comparisonmentioning
confidence: 99%
“…There are two basic methods of mapping the scanning of protein sequence databases to a parallel processor: one is based on the systolisation of the sequence comparison algorithm, the other is based on the distribution of the computation of pairwise comparisons. Systolic arrays have been proven as a good candidate structure for the first approach [5,17], while more expensive supercomputers and networks of workstations are suitable architectures for the second [10]. This paper presents two solutions to high performance database scanning on two new architectures: a hybrid parallel computer and the Fuzion 150.…”
Section: Introductionmentioning
confidence: 99%
“…P-NAC was the first such machine and computed edit distance over a four-character alphabet [16]. More recent examples, better tuned to the needs of computational biology, include BioScan, BISP, and SAMBA [5,12,18].…”
Section: Previous Workmentioning
confidence: 99%
“…There are two basic methods of mapping the scanning of sequence databases to a parallel processor: one is based on the systolisation of the sequence comparison algorithm, the other is based on the distribution of the computation of pairwise comparisons. Systolic array architectures have been proven as a good candidate structure for the first approach [5,12,18], while more expensive supercomputers and networks of workstations are suitable architectures for the second [7,15].…”
Section: Introductionmentioning
confidence: 99%