Currently, there are two major heuristic algorithms for performing database searches: BLAST and FASTA.

Currently, there are two major heuristic algorithms for performing database searches: BLAST and FASTA. Correct Answer True

These methods are not guaranteed to find the optimal alignment or true homologs, but are 50–100 times faster than dynamic programming. The increased computational speed comes at a moderate expense of sensitivity and specificity of the search, which is easily tolerated by working molecular biologists. Both programs can provide a reasonably good indication of sequence similarity by identifying similar sequence segments.
Bissoy MCQ

Related Questions

You are the database administrator for a financial services company. Employees enter data 24 hours a day into a SQL Server 2000 database. These employees report slower response times when new account information is gathered from branch offices and added to the database. You currently use the following BULK INSERT statement to add the account information.BULK INSERT finance.dbo.customersFROM 'd:bulkaccts143_10142000.txt'WITH DATAFILETYPE = 'char', FIELDTERMINATOR = 't', ROWTERMINATOR = 'n', TABLOCK You want to ensure that response times do not slow when new account information is added to the database. What should you do?
Why do companies use external job searches instead of internal searches?
Which of the following is untrue regarding BLAST and FASTA?
FASTA and BLAST are __________ but __________ for larger datasets.
BLAST uses a _______ to find matching words, whereas FASTA identifies identical matching words using the _____
Which of the following is not a benefit or a factual of FASTA over BLAST?