100% tevredenheidsgarantie Direct beschikbaar na betaling Zowel online als in PDF Je zit nergens aan vast
logo-home
Eerder door jou gezocht
Eerder door jou gezocht
logo
BIOL 266 Final Exam Study Guide Solutions €11,81   In winkelwagen
Snel navigeren naar
Voorbeeld
  2.  
  3. Prep Tests
  4.  
  5. Prep Tests

Tentamen (uitwerkingen)

BIOL 266 Final Exam Study Guide Solutions
 0 keer bekeken  0 keer verkocht
  • Vak
  • Prep Tests
  • Instelling
  • Prep Tests

BIOL 266 Final Exam Study Guide Solutions Core data - ANSWER--the key information inputted in the database entry -minimal information is given to identify the data Annotations - ANSWER-all additional information to identify data that may change over time P AND Q - ANSWER-all query searches that...

[Meer zien]

Voorbeeld 3 van de 17  pagina's

Document informatie

  • 3 november 2024
  • 17
  • 2024/2025
  • Tentamen (uitwerkingen)
  • Vragen en antwoorden

Onderwerpen

  • biol 266 final exam study guide solutions

Geschreven voor

  • Prep Tests
  • Prep Tests

Verkoper

avatar-seller
KaylinHoffman

Voorbeeld van de inhoud

Copyright © KAYLIN 2024/2025 ACADEMIC YEAR. ALL RIGHTS RESERVED FIRST PUBLISH NOVEMBER, 2024




BIOL 266 Final Exam Study Guide Solutions


Core data - ANSWER✔✔--the key information inputted in the database entry


-minimal information is given to identify the data


Annotations - ANSWER✔✔-all additional information to identify data that may change over time


P AND Q - ANSWER✔✔-all query searches that include both P and Q, but not separately


P OR Q - ANSWER✔✔-all query searches that include both P and Q, together or separately


P NOT Q - ANSWER✔✔-all query searches that include just P, but nothing with Q


P NOR Q - ANSWER✔✔-query searches that do not include P or Q


P NAND Q - ANSWER✔✔-all query searches that include P and Q separately, everything else except for P

and Q co-occurring


P XOR Q - ANSWER✔✔-query searches including P and Q occurring separately, not together


P XNOR Q - ANSWER✔✔-query searches including P and Q together (not separately), and everything

outside


global alignment - ANSWER✔✔-attempting to align an entire sequence


local alignment - ANSWER✔✔-attempting to align stretches of sequence with higher density of matches




Copyright ©Stuvia International BV 2010-2024 Page 1/17

,Copyright © KAYLIN 2024/2025 ACADEMIC YEAR. ALL RIGHTS RESERVED FIRST PUBLISH NOVEMBER, 2024


What is the best algorithm for determining the best alignment between two sequences? - ANSWER✔✔--

While looking at all alignment possibilities is the best way to determine the best possible alignment, this

is not feasible


- Dynamic programming is the best algorithm to approximate the best alignment


How does a dynamic programming algorithm work? - ANSWER✔✔-- break the problem (sequence) into

smaller subsets and solve them all individually, then put them back together


What scoring matrix is used for proteins, and how does it work? - ANSWER✔✔--BLOSUM62


- is a 20x20 matrix that scores how often certain amino acids align


- high positive scores indicate that the pairing is rare, and therefore more significant


How is scoring different within a translation/transversion matrix? - ANSWER✔✔--certain base changes

are penalized more than others


- transversions (changing from purine to pyrimidine) is penalized higher than translations (purine/purine

or pyrimidine/pyrimidine)


What type of alignment algorithm is the Needleman-Wunsch? - ANSWER✔✔-Global alignment


What type of alignment algorithm is the Smith-Waterman, and how does it differ from the Needleman-

Wunsch? - ANSWER✔✔-- Local alignment


- Scoring is harsher- mismatches are scored as 0, and if a score is negative it is scored as 0 in the matrix


Homology - ANSWER✔✔-similarity due to common ancestry


What is a flat file database? - ANSWER✔✔-A database in which all the data is stored in a single table/file

that may be downloaded

Copyright ©Stuvia International BV 2010-2024 Page 2/17

, Copyright © KAYLIN 2024/2025 ACADEMIC YEAR. ALL RIGHTS RESERVED FIRST PUBLISH NOVEMBER, 2024


What is a relational database? - ANSWER✔✔-database where the data is separated into different tables

so you can easily find what you are looking for


Why are operators useful in query searches? - ANSWER✔✔-databases are very large, and operators help

to limit information gathered from a search and specify the results


What is a heuristic approach, and when is it used? - ANSWER✔✔-An approximate answer to what the

solution likely is


-used when it is not feasible to examine all possible solutions (ie too large of a dataset)


What is BLAST, and how does it work? - ANSWER✔✔--Basic Local Alignment Search Tool


- heuristic procedure


- initially finds ungapped, locally optimal sequence alignments and then chops the sequence into smaller

frames


-search the database to find sequences that share the frames, which will be candidates for alignment


- candidates will be aligned with original sequence using Smith-Waterman algorithm


What is an expectation (E) value? - ANSWER✔✔-the number of matches with scores equivalent to or

better than the sequence that are expected to occur in the database search


- the smaller the E-value, the less likely it is to find a better match


blastp - ANSWER✔✔-protein vs protein database


blastn - ANSWER✔✔-nucleotide vs nucleotide database


blastx - ANSWER✔✔-Search protein database using a translated nucleotide query



Copyright ©Stuvia International BV 2010-2024 Page 3/17

Voordelen van het kopen van samenvattingen bij Stuvia op een rij:

√ Verzekerd van kwaliteit door reviews

√ Verzekerd van kwaliteit door reviews

Stuvia-klanten hebben meer dan 700.000 samenvattingen beoordeeld. Zo weet je zeker dat je de beste documenten koopt!

Snel en makkelijk kopen

Snel en makkelijk kopen

Je betaalt supersnel en eenmalig met iDeal, Bancontact of creditcard voor de samenvatting. Zonder lidmaatschap.

Focus op de essentie

Focus op de essentie

Samenvattingen worden geschreven voor en door anderen. Daarom zijn de samenvattingen altijd betrouwbaar en actueel. Zo kom je snel tot de kern!

Veelgestelde vragen

Wat krijg ik als ik dit document koop?

Je krijgt een PDF, die direct beschikbaar is na je aankoop. Het gekochte document is altijd, overal en oneindig toegankelijk via je profiel.

Tevredenheidsgarantie: hoe werkt dat?

Onze tevredenheidsgarantie zorgt ervoor dat je altijd een studiedocument vindt dat goed bij je past. Je vult een formulier in en onze klantenservice regelt de rest.

Van wie koop ik deze samenvatting?

Stuvia is een marktplaats, je koop dit document dus niet van ons, maar van verkoper KaylinHoffman. Stuvia faciliteert de betaling aan de verkoper.

Zit ik meteen vast aan een abonnement?

Nee, je koopt alleen deze samenvatting voor €11,81. Je zit daarna nergens aan vast.

Is Stuvia te vertrouwen?

4,6 sterren op Google & Trustpilot (+1000 reviews)

Afgelopen 30 dagen zijn er 83637 samenvattingen verkocht

Opgericht in 2010, al 14 jaar dé plek om samenvattingen te kopen

Start met verkopen
€11,81
  • (0)
  Kopen