Free Online Flashcard Deck

7 Computational Methods and Tools Free Online FlashCards

Study 7 Computational Methods and Tools with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.

12 cards
01
Front

What is an algorithm?

Back

An algorithm is a defined procedure for solving a problem; its usefulness depends on the quality of its answer and the resources it requires.

02
Front

How does dynamic programming find an alignment?

Back

It fills a table with optimal scores for smaller sequence prefixes, then traces through the table to recover an alignment.

03
Front

How do global and local alignment differ?

Back

Global alignment compares sequences across their full lengths; local alignment finds their most similar subsections.

04
Front

Which classic methods perform global and local alignment?

Back

Needleman–Wunsch is a classic global alignment method; Smith–Waterman is a classic local alignment method.

05
Front

How does BLAST search sequence databases?

Back

BLAST finds short candidate matches, extends promising ones, and reports alignments with scores and statistical estimates. It is a heuristic, not an exhaustive calculation of every possible alignment.

06
Front

What does a BLAST E-value estimate?

Back

An E-value estimates how many matches scoring at least as well as the observed match are expected by chance in a search of that database size. A lower value generally gives stronger evidence against a chance match.

07
Front

How can a k-mer index speed up sequence searches?

Back

A k-mer index stores locations of short sequence words, helping searches such as read mapping avoid repeatedly scanning every position.

08
Front

How can graphs support genome assembly?

Back

Overlapping reads can be represented as paths or edges in a graph; algorithms use the graph to infer a sequence or set of contigs consistent with the read evidence.

09
Front

What does a p-value mean?

Back

A p-value is the probability, assuming the null hypothesis and statistical model are true, of observing a result at least as extreme as the one obtained.

10
Front

What does an FDR threshold control?

Back

The Benjamini–Hochberg false-discovery-rate method adjusts interpretation across a set of tests. An FDR threshold controls the expected proportion of false discoveries among results called significant under the method’s assumptions.

11
Front

What base-calling error probabilities correspond to Q20 and Q30?

Back

The Phred scale relates score and estimated base-calling error probability by Q=−10log⁡10(P)Q = -10\log_{10}(P). Thus Q20 corresponds to an estimated 1% error probability, and Q30 to 0.1%.

12
Front

What do workflow managers provide for bioinformatics analyses?

Back

Workflow managers specify analysis steps, dependencies, inputs, and outputs. They help automate repeatable runs and scale analyses across computers or platforms.