Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-05-17T06:19:54.057Z Has data issue: false hasContentIssue false

8 - Statistics of BLAST Database Searches

Published online by Cambridge University Press:  05 June 2012

Rex A. Dwyer
Affiliation:
The BioAlgorithmic Consultancy
Get access

Summary

In Chapter 7, we justified the use of fast alignment heuristics like BLAST by our need to quickly align large numbers of sequences in a database with a given query sequence to determine which were most similar to the query. In this chapter, we will consider statistical aspects of the set of alignment scores we might encounter when performing such a database search. The distribution of scores obviously depends on the substitution matrix employed (PAM30, BLOSUM62, PAM250, etc.), and a proof of the general result requires rather extensive use of sophisticated mathematical notation. We will avoid this by concentrating on a specific, simple scoring matrix for DNA before outlining the general result.

Like all but the most recent versions of BLAST, we will focus on gapless alignments. The theory of statistical properties of scores of alignments with gaps has been elucidated only approximately and only for special cases. The theory supports the empirical observation that their behavior is similar to the behavior of statistics without gaps.

BLAST Scores for Random DNA

Suppose that Q is a query sequence of DNA and that D is a sequence from a database. As usual for DNA, we will score +1 for matched bases and -1 for mismatched bases in alignments of D and Q. Suppose a BLAST search discovers a local gap-free alignment with a score of 13. Does this suggest that D and Q are in some way related, or could this be better explained by chance? To answer this question, we must define precisely what “by chance” means to us, and then compute – or at least estimate – the probability that a score of 13 or higher occurs under that definition.

Type
Chapter
Information
Genomic Perl
From Bioinformatics Basics to Working Code
, pp. 109 - 126
Publisher: Cambridge University Press
Print publication year: 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×