Homology search with binary and trinary scoring matrices

Protein homology search can be accelerated with the use of bit-parallel algorithms in conjunction with constraints on the values contained in the scoring matrices. Trinary scoring matrices (containing only the values -1, 0, and 1) allow for significant acceleration without significant reduction in t...

Full description

Saved in:
Bibliographic Details
Published in:International journal of bioinformatics research and applications Vol. 2; no. 2; p. 119
Main Author: Smith, Scott F
Format: Journal Article
Language:English
Published: Switzerland 2006
Subjects:
Algorithms
Computational Biology - methods
Databases, Protein
False Positive Reactions
Models, Statistical
Proteins - chemistry
ROC Curve
Sensitivity and Specificity
Sequence Alignment
Sequence Analysis
Sequence Analysis, Protein
Software
ISSN:1744-5485
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Protein homology search can be accelerated with the use of bit-parallel algorithms in conjunction with constraints on the values contained in the scoring matrices. Trinary scoring matrices (containing only the values -1, 0, and 1) allow for significant acceleration without significant reduction in the receiver operating characteristic (ROC) score of a Smith-Waterman search. Binary scoring matrices (containing the values 0 and 1) result in some reduction in ROC score, but result in even more acceleration. Binary scoring matrices and five-bit saturating scores can be used for fast prefilters to the Smith-Waterman algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1744-5485
DOI:10.1504/IJBRA.2006.009763