1-BIN-301, 2-AIN-501 Methods in Bioinformatics, 2023/24

Introduction · Rules · Tasks and dates · Materials · Moodle
Quizzes can be found in Moodle.
Homework assignments and journal club papers can be found in Tasks and dates.
Exam rules, example questions and syllabus
Groups for journal club have each their own group in Moodle.


Výsledky vyhľadávania

Prejsť na: navigácia, hľadanie
  • ** po 1.6% označených CG, GC. ...cted DNA sequence(s)" by sa Vam malo v oboch riadkoch objavit "Pasted file 1"
    14 KB (1 797 slov) - 11:57, 16. november 2023
  • ...ook. This can also be expressed as title, for compatibility with version 0.1. "moby dick or the white whale" ...rts of a book, e.g. "124-147" ... This data element includes the OpenURL 0.1 definition of "pages".
    6 KB (627 slov) - 22:38, 7. október 2009
  • ...to pagination cannot be interpreted as a start-end pair, i.e. "A7, C4-9", "1-3,6".
    5 KB (581 slov) - 22:38, 7. október 2009
  • * '''date''': ''<nowiki>[[January 1]], [[2006]]</nowiki>''. Full [[Wikipedia:Date#Dates|date]] of publication. |date=[[October 1]], [[1879]]
    11 KB (1 491 slov) - 22:38, 7. október 2009
  • #if: {{#if: {{{url|}}} | {{#if: {{{title|}}} |1}}}} | {{#if: {{#if: {{{archiveurl|}}}| {{#if: {{{archivedate|}}} |1}}}}
    3 KB (224 slov) - 22:38, 7. október 2009
  • #ifexist: {{{1|{{Documentation/docname}}}}} ...s -->[[{{fullurl:{{{1|{{Documentation/docname}}}}}}} view]] [[{{fullurl:{{{1|{{Documentation/docname}}}}}|action=edit}} edit]]
    3 KB (308 slov) - 22:38, 7. október 2009
  • ...f: {{SUBJECTSPACE}} |{{lc:{{SUBJECTSPACE}}}} page|article}} itself, see {{{1|[[{{ #if: {{SUBJECTSPACE}} |{{SUBJECTSPACE}}:}}{{BASEPAGENAME}}]]}}}.</span
    1 KB (152 slov) - 22:38, 7. október 2009
  • ...s [[wikt:intricate|intricate]] features of template syntax.''' {{nowrap|{{{1|}}}}}<div style="font-size:95%; padding-bottom:2px;">You are encouraged to
    2 KB (197 slov) - 22:38, 7. október 2009
  • <!-- {{Mergefrom|{{{1|}}}|{{{2|}}}|date={{{date|}}}}} begin -->{{ambox | text = It has been suggested that ''[[:{{NAMESPACE}}:{{{1}}}|{{{1}}}]]'' be [[Wikipedia:Merging and moving pages|merged]] into this {{#if:{{N
    880 B (99 slov) - 22:38, 7. október 2009
  • <span style="white-space:nowrap">{{{1}}}</span><noinclude>{{documentation}}<!--interwikis/categories go inside do
    129 B (13 slov) - 22:38, 7. október 2009
  • ====Option 1 (only specific references) — Example: [[The Rule]]==== * general reference 1
    5 KB (671 slov) - 22:38, 7. október 2009
  • {{[[Template:{{{1}}}|{{{1}}}]]}}<noinclude>
    91 B (7 slov) - 22:38, 7. október 2009
  • ...1|}}}|{{#ifeq:{{lcfirst:{{{1|}}}}}|{{lc:{{{1|}}}}}|{{lcfirst:{{{1|}}}}}|{{{1}}}}}]]<!--
    716 B (58 slov) - 22:38, 7. október 2009
  • ...enne musia mat celociselne hodnoty, alebo dokonca povolime iba hodnoty 0 a 1. * Pouzijeme binarne premenne x_1..x_n, kde x_i = 1 prave vtedy ked sme zobrali i-ty predmet.
    6 KB (991 slov) - 10:03, 14. december 2023
  • ** G = dlzka genomu, napr. 1 000 000 ** Priklad 1: hodime idealizovanou kockou, premenna X bude hodnota, ktoru dostaneme
    85 KB (10 405 slov) - 20:30, 1. október 2014
  • js.src = "//connect.facebook.net/en_US/sdk.js#xfbml=1&version=v2.5";
    950 B (121 slov) - 14:26, 23. september 2016
  • ...tem for course discussion and announcements<!-- , within course team "2021 1-BIN-301 Methods in Bioinformatics". -->
    635 B (98 slov) - 11:03, 21. september 2022
  • ** Hint 1: Kosmáč bielofúzy je po anglicky Marmoset
    3 KB (531 slov) - 23:08, 11. september 2016
  • ** Verzia z 1.10.2015: [[Media:skripta-2015-10-01.pdf|pdf]] | || colspan="3" | '' BV kap. 1''
    153 KB (24 430 slov) - 14:44, 1. december 2016
  • * Priklad 1: hodime idealizovanou kockou, premenna X bude hodnota, ktoru dostaneme * Mozne hodnoty 1,2,..,6, kazda rovnako pravdepodobna
    122 KB (18 985 slov) - 11:18, 4. október 2012
  • * Strom s n vrcholmi ma n-1 hran * Zakoreneny binarny strom s n listami ma n-1 vnutornch vrcholov, teda 2n-2 hran
    125 KB (19 534 slov) - 21:35, 2. október 2011
  • ...biotechnology, 37(2), pp.152-159. https://doi.org/10.1038/s41587-018-0010-1 '''Man, Király, Pidlypska, Bisták, Pizarroso Troncoso, Mayoz Aranda, Alon ...g phosphorylation sites and mutations in cancer. Nature communications, 12(1), p.2313. https://doi.org/10.1038/s41467-021-22481-w '''Lebed, Korbeľová,
    4 KB (520 slov) - 10:17, 19. október 2023
  • ...nania, v ktorom má každá pozícia pravdepodobnosť p, že bude zhoda a (1-p), ze bude nezhoda alebo medzera, zarovnanie ma dlzku L * Nahodna premenna X_i = 1 ak na pozicii i je zhoda, 0 inak
    15 KB (2 339 slov) - 12:10, 20. október 2023
  • | || colspan="3" | ''{{{1}}}''
    156 B (25 slov) - 13:28, 15. október 2020
  • ..., v ktorom má každý vnútorný vrchol 2 deti. Takýto strom vždy má n-1 vnútorných vrcholov a 2n-2 vetiev (prečo?) ...aciu takychto vymen dostavame ine poradie, celkovy pocet poradi je 2<sup>n-1</sup>
    9 KB (1 586 slov) - 16:20, 26. október 2023
  • IQ-TREE 1.5.5 built Jun 21 2017 A-T: 1.0000
    18 KB (1 328 slov) - 18:18, 15. november 2018
  • * Napr mame mince hodnoty 1,2,5 centov, z kazdej dostatok kusov * Ake je riesenie? 5+5+2+1 (4 mince)
    151 KB (21 741 slov) - 21:11, 1. október 2014
  • ** Verzia z 2.1.2014: [[Media:skripta-2015-10-01.pdf|pdf]] | || colspan="3" | '' ZB kap. 1''
    169 KB (24 780 slov) - 17:10, 12. november 2015
  • ...a matematicka teoria [https://www.ncbi.nlm.nih.gov/BLAST/tutorial/Altschul-1.html] * Napr blastn pre skorovaci system zhoda 1, nezhoda -1, medzera -2 používa lambda=0.800, K=0.0640
    3 KB (525 slov) - 14:08, 19. október 2023
  • ** Nech listy su 1..n a vnut. vrcholy n+1..2n-1, pricom koren je 2n-1. ...modeli <math>P(A|A,t) = (1+3e^{-\frac{4}{3} t})/4 </math>, <math>P(C|A,t)=(1-e^{-\frac{4}{3} t})/4</math>
    3 KB (528 slov) - 10:16, 12. november 2020
  • <math>Pr(S, A) = \pi_{A_1} e_{A_1,S_1} \prod_{i=2}^n a_{A_{i-1, A_i}} e_{A_i, S_i} </math> ** <math>V[1,u] = \pi_u e_{u,S_1}</math> (*)
    8 KB (1 364 slov) - 09:31, 28. október 2020
  • ...se-1-phosphate uridylyltransferase u baktérie Haemophilus influenzae (GAL-1-P) ([https://www.uniprot.org/uniprot/P31764 Uniprot]) ** GAL-1-P má domény [https://www.ebi.ac.uk/interpro/entry/pfam/PF02744/ GalP_UDP_
    7 KB (1 097 slov) - 11:47, 7. december 2023
  • cd 1-seq spades.py -t 1 -m 1 --pe1-1 miseq_R1.fastq.gz --pe1-2 miseq_R2.fastq.gz -o spades > spades.log
    6 KB (1 023 slov) - 15:13, 16. november 2023
  • ** <math>\Pr(S_i|W,o_i) = \prod_{j=1}^{L} W[S_i[j+o_i-1],j] \prod_{j=1}^{o_i-1} q[S_i[j]] \prod_{j=o_i+L}^m q[S_i[j]]</math> ** <math>\Pr(S|W,O) = \prod_{i=1}^n \Pr(S_i|W,o_i)</math>
    13 KB (2 145 slov) - 20:22, 18. november 2020
  • 0 0 0 1 1 2 3 3 3 4 4 4 G 0 0 0 1 2 2 2 2 3 4 4 A
    3 KB (370 slov) - 14:54, 8. december 2022
  • Príklad 1: hodíme idealizovanou kockou, premenná X bude hodnota, ktorú dostaneme * Možné hodnoty 1,2,..,6, každá rovnako pravdepodobná
    10 KB (1 694 slov) - 16:00, 6. október 2022
  • Príklad 1: hodíme idealizovanou kockou, premenná X bude hodnota, ktorú dostaneme * Možné hodnoty 1,2,..,6, každá rovnako pravdepodobná
    10 KB (1 494 slov) - 15:40, 30. september 2022
  • * Course 1-BIN-301 is for computer-science related programs, namely BIN, INF, mINF, mA * Quizzes 10% (each week 1%)
    6 KB (1 047 slov) - 15:29, 16. november 2023
  • <big>'''<font color="#a01010">1-BIN-301, 2-AIN-501 Methods in Bioinformatics, 2023/24</font>'''</big>
    1 KB (208 slov) - 10:41, 7. december 2023
  • | colspan="4" | '''{{{1}}}''' {{{2}}} <span id="w{{{3}}}"></span>
    99 B (13 slov) - 22:51, 12. október 2021
  • {{W|1}}, {{W|2}}, {{W|3}}, {{W|4}}, {{W|5}}, {{W|6}}, {{W|7}}, {{W|8}}, {{W|9}}, {{T|Sept. 21||1}}
    7 KB (903 slov) - 10:51, 7. december 2023
  • [[#w{{{1}}}|Week {{{1}}}]]
    26 B (2 slová) - 22:53, 12. október 2021
  • | '''{{{1}}}:''' || {{{2}}} || {{{3}}} || {{{4}}}
    55 B (3 slová) - 09:11, 20. september 2014
  • [[Media:{{{1}}}.pdf|pdf]]
    25 B (3 slová) - 09:19, 20. september 2014
  • | || colspan="3" | ''{{{1}}}''
    59 B (6 slov) - 11:24, 20. september 2014
  • {| border="1" style="border-collapse:collapse" {{DU | Homework 1 | Oct. 20, 2023 | Nov. 8, 2023 22:00}}
    2 KB (299 slov) - 16:21, 30. november 2023
  • | style="background:#f0f0f0" | '''{{{1}}}'''
    72 B (8 slov) - 07:49, 27. október 2023
  • * Priklad 1: hodime idealizovanou kockou, premenna X bude hodnota, ktoru dostaneme * Mozne hodnoty 1,2,..,6, kazda rovnako pravdepodobna
    169 KB (24 577 slov) - 21:09, 1. október 2014
  • ** Verzia z 1.10.2015: ...n="3" | '' BV kap. 1'', [https://www.youtube.com/watch?v=3HI-wKmTuSs video 1] [https://www.youtube.com/watch?v=iHt5WPVFd7E video 2]
    182 KB (29 744 slov) - 10:38, 22. september 2021
  • Exam is for 1-BIN-301 (mainly AIN, BIN, DAV, INF students). ...nt of sequences TACGT and CAGGATT, where the match has score +3, mismatch -1, gap -2. Reconstruct also the optimal alignments found by the dynamic progr
    13 KB (1 906 slov) - 16:27, 7. december 2023

Zobraziť (predošlých 50 | ďalších 50) (20 | 50 | 100 | 250 | 500).