[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M75K975AA72WQNQAMEP41DR8":3,"skill-same:01M75K975AA72WQNQAMEP41DR8":46},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":24,"commitSha":25,"skillDirectory":26,"forksCount":27,"repositoryHtmlUrl":28,"repositoryHomepageUrl":6,"ownerHtmlUrl":29,"ownerBlogUrl":6,"ownerDescription":30,"updatedAt":31,"install":32,"resources":45},"01M75K975AA72WQNQAMEP41DR8","motif-search",null,"Find patterns, motifs, and binding sites in DNA\u002FRNA\u002Fprotein sequences — using regex, IUPAC patterns, position weight matrices, and modern motif databases (JASPAR 2024, CIS-BP).","pradyumnasagar\u002Fopen-research-skills","pradyumnasagar","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F10559871?v=4","01M75K78MYCCVKRTYGT8KKC380","Pradyumna Jayaram","01M75K78NTNE41F2PE1XBVFHAS",8,"MIT","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Fskills\u002Fbioinformatics-sequence\u002Fmotif-search\u002FSKILL.md",[],[],"2026-11-12 13:55:43",false,"---\n\nname: motif-search\ndescription: \"Find patterns, motifs, and binding sites in DNA\u002FRNA\u002Fprotein sequences — using regex, IUPAC patterns, position weight matrices, and modern motif databases (JASPAR 2024, CIS-BP).\"\nlicense: MIT\n---\n\u003C!-- metadata:\n  category: bioinformatics-sequence\n  oversight: low\n  version: 1.0.0\n  author: Pradyumna Jayaram\n  tags: [bioinformatics-sequence, research]\n  difficulty: intermediate\n-->\n\n# Motif and Pattern Search\n## Hard rules\n\n1. **No fabricated citations.** Every cited work must resolve to a verifiable\n2. **No claim without provenance.** Every quantitative or factual claim\n3. **No silent failure.** Every script invocation, API call, or tool use must declare its exit status and what to do on non-zero. A skill that silently swallows errors is a violation.\n\n## When to use\n\n- Finding a known regulatory element in a sequence (TATA box, Kozak, poly-A).\n- Scanning a promoter for a transcription factor binding site.\n- Confirming an enzyme recognition site in a designed construct.\n- Searching for a protein motif (PROSITE, Pfam) with a regex.\n\n## When NOT to use\n\n- De novo motif discovery from ChIP-seq → use `MEME` \u002F `STREME`.\n- Genome-wide PWM scan → use `MOODS`, `FIMO`, or `pyMOODS`.\n- Protein domain detection → use `pyhmmer` or `InterProScan`.\n\n## Prerequisites\n\n- `biopython>=1.83`\n- For advanced regex: `regex` package (supports fuzzy matching, IUPAC natively).\n- For JASPAR motifs: `pyjaspar` (modern replacement for Biopython's JASPAR module).\n- For genome-wide scans: `MOODS` (C++) or `FIMO` (MEME Suite).\n\n## Core workflow\n\n1. **Decide the motif type**: literal, IUPAC, or PWM.\n2. **For literal\u002FIUPAC**: regex is fastest.\n3. **For PWM**: convert to a log-odds matrix, scan with a sliding window.\n4. **Validate hits biologically** (one perfect match in a 10 kb promoter is suspicious; a 7\u002F8 match with a known co-factor is meaningful).\n\n## Code patterns\n\n### Literal motif (regex)\n\n```python\nimport re\nfrom Bio import SeqIO\n\nseq = str(next(SeqIO.parse(\"promoter.fasta\", \"fasta\")).seq)\nfor m in re.finditer(r\"TATAAA\", seq):\n    print(f\"TATA box at {m.start()}\")\n```\n\n### IUPAC consensus\n\nIUPAC codes are valid regex characters *except* a few that collide with regex syntax (`*`, `?`, `(`, `)`). Use Biopython's IUPAC-to-regex helper:\n\n```python\nfrom Bio.Data.IUPACData import ambiguous_dna_values\n\ndef iupac_to_regex(motif: str) -> str:\n    \"\"\"Convert IUPAC DNA to a regex character class.\"\"\"\n    return \"\".join(f\"[{ambiguous_dna_values[c]}]\" for c in motif.upper())\n\npat = re.compile(iupac_to_regex(\"RRRYYCC\"))  # poly-A signal\nfor m in pat.finditer(seq):\n    print(m.start(), m.group())\n```\n\n### Reverse-strand search\n\nMany regulatory motifs are on the antisense strand:\n\n```python\ndef find_on_both_strands(seq: str, motif_regex):\n    rc = str(Seq(seq).reverse_complement())\n    for strand, s in ((\"+\", seq), (\"-\", rc)):\n        for m in motif_regex.finditer(s):\n            print(f\"{strand}\\t{m.start()}\\t{m.group()}\")\n```\n\n### PROSITE-style protein motif\n\n```python\npsp = re.compile(r\"G.{1,2}GV[AGST]G[AGILV]KT\")  # P-loop NTP-binding\nfor m in psp.finditer(str(protein.seq)):\n    print(m.start(), m.group())\n```\n\n### Fuzzy matching (sequencing errors)\n\n`regex` package supports approximate matching with `e\u003C=N` for up to N edits:\n\n```python\nimport regex\nfor m in regex.finditer(r\"(TATAAA){e\u003C=1}\", seq):\n    print(m.start(), m.group(), m.fuzzy_counts)\n```\n\n### Position Weight Matrix (PWM) from a JASPAR-style count matrix\n\n```python\nimport numpy as np\nfrom Bio import motifs\n\ncounts = motifs.CountsMatrix(\n    [\n        [10,  3,  1,  2],   # A\n        [ 2,  8,  1,  3],   # C\n        [ 1,  2,  9,  2],   # G\n        [ 1,  2,  3,  7],   # T\n    ],\n    alphabet=\"ACGT\",\n)\npwm = counts.normalize(pseudocounts=0.5)\npssm = pwm.log_odds()    # log2 odds vs uniform\n```\n\n### Scan a sequence with a PSSM\n\n```python\nthreshold = 5.0\nfor pos, score in pssm.search(seq, threshold=threshold, both=True):\n    print(f\"hit at {pos}, score={score:.2f}\")\n```\n\n### Load a JASPAR motif (modern, 2026)\n\n```python\nimport pyjaspar\n\n# pyjaspar 2.x supports JASPAR 2024 releases\nmotif = pyjaspar.get_motif_by_id(\"MA0006.1\")  # Arnt\npwm = motif.profile_matrix   # 4 x len\n```\n\n### Reverse-complement-aware PWM scan (TF binding is double-stranded)\n\n```python\n# Biopython's `search(both=True)` already does this\nhits = list(pssm.search(seq, threshold=6.0, both=True))\n```\n\n### Find all occurrences of restriction sites\n\n```python\nfrom Bio.Restriction import EcoRI, BamHI, HindIII\n\nsites = []\nfor enz in (EcoRI, BamHI, HindIII):\n    for hit in enz.search(seq):\n        sites.append((hit, enz))\n```\n\n## Common pitfalls\n\n- **IUPAC in regex breaks silently.** `[ACGT]` works, but `R` alone is just a literal `R`. Always use the Biopython IUPAC-to-regex helper.\n- **PWM scan without background correction** gives wrong scores. Always use log-odds (PWM), not raw frequencies.\n- **JASPAR 2024 release restructured motif IDs** — old `MA0006.1` may be `MA0006.2`. `pyjaspar` handles aliases.\n- **TATA box at position 0 is a false positive.** It's probably the start of a sequence header; offset by 50+ bp from a TSS.\n- **Single PWM hit ≠ functional binding site.** Combine with chromatin accessibility (ATAC-seq), conservation (phastCons), and co-factor motifs for credible predictions.\n\n## Validation\n\n- For known motifs, the hit count is in the expected ballpark (e.g., a TATA box should appear in ~30-50% of vertebrate Pol II promoters, not 100%).\n- For a PSSM, scan a known positive sequence first to confirm the threshold.\n- Forward- and reverse-strand hits should be roughly equal in a random sequence (motif symmetry test).\n\n## Open alternatives\n\n| Need | Tool |\n|------|------|\n| Genome-wide PWM scan | `FIMO` (MEME Suite), `MOODS` |\n| JASPAR motif access | `pyjaspar`, JASPAR REST API |\n| De novo motif discovery | `MEME`, `STREME` |\n| ChIP-seq peaks → motifs | `HOMER`, `MEME-ChIP` |\n| Restriction enzyme mapping | `Bio.Restriction`, `REmatch` |\n\n## References\n\n- Biopython `Bio.motifs`: \u003Chttps:\u002F\u002Fbiopython.org\u002Fdocs\u002Flatest\u002Fapi\u002FBio.motifs.html>\n- JASPAR 2024: \u003Chttps:\u002F\u002Fjaspar.genereg.net\u002F>\n- MEME Suite: \u003Chttps:\u002F\u002Fmeme-suite.org\u002Fmeme\u002F>\n- pyjaspar: \u003Chttps:\u002F\u002Fgithub.com\u002Fasntech\u002Fpyjaspar>\n- Companion: `ors-bioinformatics-sequence-seq-objects`, `ors-bioinformatics-functional-motif-*` skills.\n\n## Changelog\n\n- 1.0.0 (2026-06-10): Initial adaptation by Pradyumna Jayaram from `bio-motif-search` (bioSkills-main\u002Fsequence-manipulation\u002Fmotif-search).\n\n## Cross-references\n\nOther skills in this category:\n\n- batch-processing\n- bowtie2-alignment\n- bwa-alignment\n- bwa-mem2-alignment\n- codon-usage\n- compressed-sequence-files\n- fastq-quality-scores\n- filter-sequences\n- format-conversion\n- hisat2-alignment\n- paired-end-fastq\n- pysam-genomics\n- read-write-sequences\n- reverse-complement\n- sam-bam-basics\n- samtools-bam-processing\n- seq-objects\n- sequence-properties\n- sequence-slicing\n- sequence-statistics\n- star-alignment\n- transcription-translation\n","\u003C!-- metadata:\n  category: bioinformatics-sequence\n  oversight: low\n  version: 1.0.0\n  author: Pradyumna Jayaram\n  tags: [bioinformatics-sequence, research]\n  difficulty: intermediate\n-->\n\n# Motif and Pattern Search\n## Hard rules\n\n1. **No fabricated citations.** Every cited work must resolve to a verifiable\n2. **No claim without provenance.** Every quantitative or factual claim\n3. **No silent failure.** Every script invocation, API call, or tool use must declare its exit status and what to do on non-zero. A skill that silently swallows errors is a violation.\n\n## When to use\n\n- Finding a known regulatory element in a sequence (TATA box, Kozak, poly-A).\n- Scanning a promoter for a transcription factor binding site.\n- Confirming an enzyme recognition site in a designed construct.\n- Searching for a protein motif (PROSITE, Pfam) with a regex.\n\n## When NOT to use\n\n- De novo motif discovery from ChIP-seq → use `MEME` \u002F `STREME`.\n- Genome-wide PWM scan → use `MOODS`, `FIMO`, or `pyMOODS`.\n- Protein domain detection → use `pyhmmer` or `InterProScan`.\n\n## Prerequisites\n\n- `biopython>=1.83`\n- For advanced regex: `regex` package (supports fuzzy matching, IUPAC natively).\n- For JASPAR motifs: `pyjaspar` (modern replacement for Biopython's JASPAR module).\n- For genome-wide scans: `MOODS` (C++) or `FIMO` (MEME Suite).\n\n## Core workflow\n\n1. **Decide the motif type**: literal, IUPAC, or PWM.\n2. **For literal\u002FIUPAC**: regex is fastest.\n3. **For PWM**: convert to a log-odds matrix, scan with a sliding window.\n4. **Validate hits biologically** (one perfect match in a 10 kb promoter is suspicious; a 7\u002F8 match with a known co-factor is meaningful).\n\n## Code patterns\n\n### Literal motif (regex)\n\n```python\nimport re\nfrom Bio import SeqIO\n\nseq = str(next(SeqIO.parse(\"promoter.fasta\", \"fasta\")).seq)\nfor m in re.finditer(r\"TATAAA\", seq):\n    print(f\"TATA box at {m.start()}\")\n```\n\n### IUPAC consensus\n\nIUPAC codes are valid regex characters *except* a few that collide with regex syntax (`*`, `?`, `(`, `)`). Use Biopython's IUPAC-to-regex helper:\n\n```python\nfrom Bio.Data.IUPACData import ambiguous_dna_values\n\ndef iupac_to_regex(motif: str) -> str:\n    \"\"\"Convert IUPAC DNA to a regex character class.\"\"\"\n    return \"\".join(f\"[{ambiguous_dna_values[c]}]\" for c in motif.upper())\n\npat = re.compile(iupac_to_regex(\"RRRYYCC\"))  # poly-A signal\nfor m in pat.finditer(seq):\n    print(m.start(), m.group())\n```\n\n### Reverse-strand search\n\nMany regulatory motifs are on the antisense strand:\n\n```python\ndef find_on_both_strands(seq: str, motif_regex):\n    rc = str(Seq(seq).reverse_complement())\n    for strand, s in ((\"+\", seq), (\"-\", rc)):\n        for m in motif_regex.finditer(s):\n            print(f\"{strand}\\t{m.start()}\\t{m.group()}\")\n```\n\n### PROSITE-style protein motif\n\n```python\npsp = re.compile(r\"G.{1,2}GV[AGST]G[AGILV]KT\")  # P-loop NTP-binding\nfor m in psp.finditer(str(protein.seq)):\n    print(m.start(), m.group())\n```\n\n### Fuzzy matching (sequencing errors)\n\n`regex` package supports approximate matching with `e\u003C=N` for up to N edits:\n\n```python\nimport regex\nfor m in regex.finditer(r\"(TATAAA){e\u003C=1}\", seq):\n    print(m.start(), m.group(), m.fuzzy_counts)\n```\n\n### Position Weight Matrix (PWM) from a JASPAR-style count matrix\n\n```python\nimport numpy as np\nfrom Bio import motifs\n\ncounts = motifs.CountsMatrix(\n    [\n        [10,  3,  1,  2],   # A\n        [ 2,  8,  1,  3],   # C\n        [ 1,  2,  9,  2],   # G\n        [ 1,  2,  3,  7],   # T\n    ],\n    alphabet=\"ACGT\",\n)\npwm = counts.normalize(pseudocounts=0.5)\npssm = pwm.log_odds()    # log2 odds vs uniform\n```\n\n### Scan a sequence with a PSSM\n\n```python\nthreshold = 5.0\nfor pos, score in pssm.search(seq, threshold=threshold, both=True):\n    print(f\"hit at {pos}, score={score:.2f}\")\n```\n\n### Load a JASPAR motif (modern, 2026)\n\n```python\nimport pyjaspar\n\n# pyjaspar 2.x supports JASPAR 2024 releases\nmotif = pyjaspar.get_motif_by_id(\"MA0006.1\")  # Arnt\npwm = motif.profile_matrix   # 4 x len\n```\n\n### Reverse-complement-aware PWM scan (TF binding is double-stranded)\n\n```python\n# Biopython's `search(both=True)` already does this\nhits = list(pssm.search(seq, threshold=6.0, both=True))\n```\n\n### Find all occurrences of restriction sites\n\n```python\nfrom Bio.Restriction import EcoRI, BamHI, HindIII\n\nsites = []\nfor enz in (EcoRI, BamHI, HindIII):\n    for hit in enz.search(seq):\n        sites.append((hit, enz))\n```\n\n## Common pitfalls\n\n- **IUPAC in regex breaks silently.** `[ACGT]` works, but `R` alone is just a literal `R`. Always use the Biopython IUPAC-to-regex helper.\n- **PWM scan without background correction** gives wrong scores. Always use log-odds (PWM), not raw frequencies.\n- **JASPAR 2024 release restructured motif IDs** — old `MA0006.1` may be `MA0006.2`. `pyjaspar` handles aliases.\n- **TATA box at position 0 is a false positive.** It's probably the start of a sequence header; offset by 50+ bp from a TSS.\n- **Single PWM hit ≠ functional binding site.** Combine with chromatin accessibility (ATAC-seq), conservation (phastCons), and co-factor motifs for credible predictions.\n\n## Validation\n\n- For known motifs, the hit count is in the expected ballpark (e.g., a TATA box should appear in ~30-50% of vertebrate Pol II promoters, not 100%).\n- For a PSSM, scan a known positive sequence first to confirm the threshold.\n- Forward- and reverse-strand hits should be roughly equal in a random sequence (motif symmetry test).\n\n## Open alternatives\n\n| Need | Tool |\n|------|------|\n| Genome-wide PWM scan | `FIMO` (MEME Suite), `MOODS` |\n| JASPAR motif access | `pyjaspar`, JASPAR REST API |\n| De novo motif discovery | `MEME`, `STREME` |\n| ChIP-seq peaks → motifs | `HOMER`, `MEME-ChIP` |\n| Restriction enzyme mapping | `Bio.Restriction`, `REmatch` |\n\n## References\n\n- Biopython `Bio.motifs`: \u003Chttps:\u002F\u002Fbiopython.org\u002Fdocs\u002Flatest\u002Fapi\u002FBio.motifs.html>\n- JASPAR 2024: \u003Chttps:\u002F\u002Fjaspar.genereg.net\u002F>\n- MEME Suite: \u003Chttps:\u002F\u002Fmeme-suite.org\u002Fmeme\u002F>\n- pyjaspar: \u003Chttps:\u002F\u002Fgithub.com\u002Fasntech\u002Fpyjaspar>\n- Companion: `ors-bioinformatics-sequence-seq-objects`, `ors-bioinformatics-functional-motif-*` skills.\n\n## Changelog\n\n- 1.0.0 (2026-06-10): Initial adaptation by Pradyumna Jayaram from `bio-motif-search` (bioSkills-main\u002Fsequence-manipulation\u002Fmotif-search).\n\n## Cross-references\n\nOther skills in this category:\n\n- batch-processing\n- bowtie2-alignment\n- bwa-alignment\n- bwa-mem2-alignment\n- codon-usage\n- compressed-sequence-files\n- fastq-quality-scores\n- filter-sequences\n- format-conversion\n- hisat2-alignment\n- paired-end-fastq\n- pysam-genomics\n- read-write-sequences\n- reverse-complement\n- sam-bam-basics\n- samtools-bam-processing\n- seq-objects\n- sequence-properties\n- sequence-slicing\n- sequence-statistics\n- star-alignment\n- transcription-translation\n",{"name":5,"license":15,"description":7},"main","9c0b41e2036cc5588c699f06e658ea6dc3b9685d","skills\u002Fbioinformatics-sequence\u002Fmotif-search",2,"https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar","PhD Scholar,\r\nManipal School Of Life Sciences, Manipal\r\n #OpenSourceDeveloper #LifeSciences #ComputationalBiology","2026-10-30 01:30:52",{"source":8,"skillName":5,"commands":33,"prompt":43,"zipAvailable":44},[34,37,40],{"tool":35,"command":36},"npx","npx skills add pradyumnasagar\u002Fopen-research-skills --skill motif-search",{"tool":38,"command":39},"bunx","bunx skills add pradyumnasagar\u002Fopen-research-skills --skill motif-search",{"tool":41,"command":42},"pnpm","pnpm dlx skills add pradyumnasagar\u002Fopen-research-skills --skill motif-search","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Fskills\u002Fbioinformatics-sequence\u002Fmotif-search\u002FSKILL.md",true,[],[47,54,60,67,74,81],{"skillNo":48,"name":49,"nameZh":6,"description":50,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":51,"categories":52,"keywords":53,"publishedAt":19},"01M75KTS5K9QNX8FQBTJW2GQSH","good-skill","A well-formed test fixture for the validation script.","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fgood-skill\u002FSKILL.md",[],[],{"skillNo":55,"name":56,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":57,"categories":58,"keywords":59,"publishedAt":19},"01M75KTR7FAT0MMMED2EGC9WZZ","BadSkill","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Ftests\u002Ffixtures\u002Fbad-skill\u002FSKILL.md",[],[],{"skillNo":61,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":64,"categories":65,"keywords":66,"publishedAt":19},"01M75KTN949EDF77GJDS8H6VR8","my-new-skill","One sentence (max 200 chars) — what the skill does and when to use it.","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Ftemplate\u002FSKILL.md",[],[],{"skillNo":68,"name":69,"nameZh":6,"description":70,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":71,"categories":72,"keywords":73,"publishedAt":19},"01M75KTHTFS121SSF1Q5X2FXDA","thesis-structure","Use when planning or checking the architecture of a PhD \u002F MPhil thesis in the life sciences or bioinformatics — monograph vs article-based, chapter sequence, IMRaD-based chapters, abstract-to-conclusion flow, and the examiner expectations that the structure must meet.","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Fskills\u002Fthesis-writing\u002Fthesis-structure\u002FSKILL.md",[],[],{"skillNo":75,"name":76,"nameZh":6,"description":77,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":78,"categories":79,"keywords":80,"publishedAt":19},"01M75KTE3WKW46FXFHQ579H8YP","thesis-methods-reproducibility","Use when writing or checking the Methods, figures, data, and code of a bioinformatics \u002F microbiology \u002F life-science PhD thesis — the FAIR data, versioned code, report-generation, figure-and-table discipline, and the reproducibility expectations that examiners probe at viva.","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Fskills\u002Fthesis-writing\u002Fthesis-methods-reproducibility\u002FSKILL.md",[],[],{"skillNo":82,"name":83,"nameZh":6,"description":84,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":85,"categories":86,"keywords":87,"publishedAt":19},"01M75KTA033ZQCJY3DC8P5VQET","thesis-defense-viva","Use when preparing for the viva voce \u002F oral thesis defense — building the examiner's question set, rehearsing the presentation, and the pre-defense polish (slides, summary, the 'what if I'm stuck' responses) for a life-science or bioinformatics PhD.","https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Fskills\u002Fthesis-writing\u002Fthesis-defense-viva\u002FSKILL.md",[],[]]