[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M75K8FKZXSFS45J1PDF9SNXH":3,"skill-same:01M75K8FKZXSFS45J1PDF9SNXH":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},"01M75K8FKZXSFS45J1PDF9SNXH","codon-usage",null,"Compute codon usage frequencies, RSCU, CAI, and tRNA adaptation — for gene expression prediction, heterologous expression design, and comparative genomics.","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\u002Fcodon-usage\u002FSKILL.md",[],[],"2026-11-12 13:55:43",false,"---\n\nname: codon-usage\ndescription: \"Compute codon usage frequencies, RSCU, CAI, and tRNA adaptation — for gene expression prediction, heterologous expression design, and comparative genomics.\"\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# Codon Usage and Bias\n\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- Predicting heterologous expression yield (high CAI in the host → likely high expression).\n- Comparing codon bias across organisms.\n- Designing codon-optimized coding sequences.\n- Building a reference codon-usage table from a genome.\n\n## When NOT to use\n\n- Gene finding (use pyrodigal \u002F bakta).\n- Variant effect on protein (use SIFT \u002F PolyPhen \u002F AlphaMissense).\n\n## Prerequisites\n\n- `biopython>=1.83`\n- For codon optimization: `dnachisel` (open source) or `GeneDesign` (open source)\n\n## Core workflow\n\n1. **Pick the right metric**: RSCU for bias *direction*, CAI for *expression* prediction, ENC for *strength* of bias.\n2. **Build or load a reference codon table** (from a host genome or a published table).\n3. **Compute the metric for your gene**.\n4. **If optimizing**, generate a sequence that maximizes the metric while preserving amino acid sequence and avoiding restriction sites \u002F RNA structures.\n\n## Code patterns\n\n### Build a codon usage table from a genome's CDS\n\n```python\nfrom Bio import SeqIO\nfrom collections import Counter\nfrom Bio.Seq import Seq\n\ndef codon_counter(cds_iter, table=1):\"\n    \"\"\"Yield codon counts from an iterator of CDS sequences.\"\"\"\n    c = Counter()\n    for s in cds_iter:\n        s = Seq(str(s).upper())\n        if len(s) % 3 != 0:\n            s = s[:len(s) - len(s) % 3]\n        for i in range(0, len(s), 3):\n            c[str(s[i:i+3])] += 1\n    return c\n```\n\n### Relative Synonymous Codon Usage (RSCU)\n\nRSCU = (observed count of codon) \u002F (expected count if all synonymous codons were equal).\n\n```python\nfrom Bio.Data import CodonTable\nfrom collections import defaultdict\n\ndef rscu(counts: dict, table_id: int = 1) -> dict:\n    t = CodonTable.unambiguous_dna_by_id[table_id]\n    aa_to = defaultdict(list)\n    for codon, aa in t.forward_table.items():\n        aa_to[aa].append(codon)\n    out = {}\n    for aa, codons in aa_to.items():\n        n_syn = len(codons)\n        total = sum(counts.get(c, 0) for c in codons)\n        if total == 0:\n            for c in codons:\n                out[c] = 0.0\n            continue\n        expected = total \u002F n_syn\n        for c in codons:\n            out[c] = counts.get(c, 0) \u002F expected if expected else 0.0\n    return out\n```\n\nRSCU > 1 means the codon is used more often than expected; \u003C 1 means less.\n\n### Codon Adaptation Index (CAI)\n\nCAI = geometric mean of relative adaptiveness (weight of each codon = RSCU \u002F max RSCU for that amino acid in the reference set).\n\n```python\nimport math\n\ndef cai(seq: str, ref_counts: dict, table_id: int = 1) -> float:\n    t = CodonTable.unambiguous_dna_by_id[table_id]\n    aa_to = defaultdict(list)\n    for codon, aa in t.forward_table.items():\n        aa_to[aa].append(codon)\n    max_w = {}\n    for aa, codons in aa_to.items():\n        total = sum(ref_counts.get(c, 0) for c in codons)\n        if total == 0:\n            for c in codons:\n                max_w[c] = 0.0\n            continue\n        weights = {c: ref_counts.get(c, 0) \u002F (total \u002F len(codons)) for c in codons}\n        m = max(weights.values()) or 1.0\n        for c, w in weights.items():\n            max_w[c] = w \u002F m\n    s = Seq(seq.upper())\n    if len(s) % 3 != 0:\n        s = s[:len(s) - len(s) % 3]\n    log_sum = 0.0\n    n = 0\n    for i in range(0, len(s), 3):\n        c = str(s[i:i+3])\n        w = max_w.get(c, 0.0)\n        if w > 0:\n            log_sum += math.log(w)\n            n += 1\n    return math.exp(log_sum \u002F n) if n else 0.0\n```\n\nCAI ranges 0-1. Higher = more \"host-like\" codons. > 0.8 is considered highly expressed in the host.\n\n### Effective Number of Codons (ENc)\n\nENc ranges 20 (extreme bias, one codon per amino acid) to 61 (no bias).\nWright 1990 formula:\n\n```python\ndef enc(counts: dict, table_id: int = 1) -> float:\n    from Bio.Data import CodonTable\n    t = CodonTable.unambiguous_dna_by_id[table_id]\n    aa_to = defaultdict(list)\n    for codon, aa in t.forward_table.items():\n        aa_to[aa].append(codon)\n\n    f_vals = []\n    for aa, codons in aa_to.items():\n        n = len(codons)\n        if n == 1:\n            continue\n        total = sum(counts.get(c, 0) for c in codons)\n        if total \u003C= 1:\n            continue\n        # homozygosity F = (n * sum(p_i^2) - 1) \u002F (n - 1)\n        p = [counts.get(c, 0) \u002F total for c in codons]\n        f = (n * sum(pi * pi for pi in p) - 1) \u002F (n - 1)\n        f_vals.append(f)\n\n    # Wright's formula\n    enc = 2 + 9 \u002F (sum(f_vals) \u002F len(f_vals)) if f_vals else 0\n    return enc\n```\n\n### Use a published reference table (E. coli K-12)\n\n```python\n# Kazusa codon usage database provides these as text\n# https:\u002F\u002Fwww.kazusa.or.jp\u002Fcodon\u002F\nECOLI_CODONS = {\n    \"ATG\": 1000,   # example, replace with real counts\n    \"TTT\":  500,\n    # ... full table from Kazusa\n}\n```\n\nFor real work, parse the Kazusa `.txt` file or use `python_codon_tables` (PyPI).\n\n### Codon optimization with DNA Chisel (open source)\n\n```python\nimport dnachisel as dc\n\nproblem = dc.DnaOptimizationProblem(\n    sequence=\"ATGGCCATTGTAATGGGCCGCTGAAAGGGTGCCCGATAG\",\n    constraints=[\n        dc.EnforceTranslation(),\n        dc.EnforceGCContent(mini=0.4, maxi=0.6, window=50),\n        dc.AvoidPattern(\"BsaI_site\"),  # avoid restriction sites\n    ],\n    objectives=[dc.CodonOptimize(species=\"e_coli\")],\n)\nproblem.resolve()\nprint(problem.sequence)  # optimized sequence\n```\n\n### Codon harmonization (preserve original codon bias, not maximize)\n\nFor cross-species expression where the source organism's translation speed pattern matters, \"harmonize\" the sequence to use the destination's most-frequent codon for each amino acid in a way that mimics the source's translational pauses.\n\nTools: `codon harmonization` Python package; CHARMING web server (academic).\n\n## Common pitfalls\n\n- **Computing CAI on the wrong frame.** A multiple-of-3 length is the only frame that produces a real CAI.\n- **RSCU of 0 for a synonymous codon that wasn't observed.** RSCU = 0 means the codon is absent in the reference; not the same as \"disallowed\".\n- **CAI close to 1 doesn't guarantee expression.** It predicts codon *availability* for the tRNA pool, not mRNA stability, protein folding, or toxicity.\n- **Optimizing for codon bias destroys mRNA structure and may introduce rare restriction sites.** Always combine with `EnforceGCContent`, `AvoidPattern`, and structure objectives.\n- **Cross-species CAI comparisons are invalid.** CAI is *relative* to a reference. Pick the host's reference, not the donor's.\n\n## Validation\n\n- CAI is in [0, 1].\n- RSCU values for synonymous codons sum to the number of synonymous codons per amino acid.\n- ENc is in [20, 61].\n- A codon-optimized sequence still translates to the same amino acid sequence (use `translate(to_stop=True)` to verify).\n\n## Open alternatives\n\n| Need | Tool |\n|------|------|\n| Codon optimization | `DNA Chisel`, `GeneDesign` |\n| CAI\u002FRSCU\u002FENc reference tables | `python_codon_tables` (PyPI), Kazusa |\n| Codon harmonization | `codon-harmonization` (PyPI), CHARMING |\n| Expression prediction (ML) | `CodonBERT`, `mRFP` |\n\n## References\n\n- Sharp & Li 1987 (CAI): \u003Chttps:\u002F\u002Fdoi.org\u002F10.1093\u002Fnar\u002F15.3.1281>\n- Wright 1990 (ENc): \u003Chttps:\u002F\u002Fdoi.org\u002F10.1093\u002Fnar\u002F18.1.171>\n- Kazusa codon DB: \u003Chttps:\u002F\u002Fwww.kazusa.or.jp\u002Fcodon\u002F>\n- DNA Chisel: \u003Chttps:\u002F\u002Fgithub.com\u002FEdinburgh-Genome-Foundry\u002FDnaChisel>\n- Companion: `ors-bioinformatics-sequence-transcription-translation`, `ors-bioinformatics-sequence-sequence-properties`.\n\n## Changelog\n\n- 1.0.0 (2026-06-10): Initial adaptation by Pradyumna Jayaram from `bio-codon-usage` (bioSkills-main\u002Fsequence-manipulation\u002Fcodon-usage).\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- compressed-sequence-files\n- fastq-quality-scores\n- filter-sequences\n- format-conversion\n- hisat2-alignment\n- motif-search\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# Codon Usage and Bias\n\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- Predicting heterologous expression yield (high CAI in the host → likely high expression).\n- Comparing codon bias across organisms.\n- Designing codon-optimized coding sequences.\n- Building a reference codon-usage table from a genome.\n\n## When NOT to use\n\n- Gene finding (use pyrodigal \u002F bakta).\n- Variant effect on protein (use SIFT \u002F PolyPhen \u002F AlphaMissense).\n\n## Prerequisites\n\n- `biopython>=1.83`\n- For codon optimization: `dnachisel` (open source) or `GeneDesign` (open source)\n\n## Core workflow\n\n1. **Pick the right metric**: RSCU for bias *direction*, CAI for *expression* prediction, ENC for *strength* of bias.\n2. **Build or load a reference codon table** (from a host genome or a published table).\n3. **Compute the metric for your gene**.\n4. **If optimizing**, generate a sequence that maximizes the metric while preserving amino acid sequence and avoiding restriction sites \u002F RNA structures.\n\n## Code patterns\n\n### Build a codon usage table from a genome's CDS\n\n```python\nfrom Bio import SeqIO\nfrom collections import Counter\nfrom Bio.Seq import Seq\n\ndef codon_counter(cds_iter, table=1):\"\n    \"\"\"Yield codon counts from an iterator of CDS sequences.\"\"\"\n    c = Counter()\n    for s in cds_iter:\n        s = Seq(str(s).upper())\n        if len(s) % 3 != 0:\n            s = s[:len(s) - len(s) % 3]\n        for i in range(0, len(s), 3):\n            c[str(s[i:i+3])] += 1\n    return c\n```\n\n### Relative Synonymous Codon Usage (RSCU)\n\nRSCU = (observed count of codon) \u002F (expected count if all synonymous codons were equal).\n\n```python\nfrom Bio.Data import CodonTable\nfrom collections import defaultdict\n\ndef rscu(counts: dict, table_id: int = 1) -> dict:\n    t = CodonTable.unambiguous_dna_by_id[table_id]\n    aa_to = defaultdict(list)\n    for codon, aa in t.forward_table.items():\n        aa_to[aa].append(codon)\n    out = {}\n    for aa, codons in aa_to.items():\n        n_syn = len(codons)\n        total = sum(counts.get(c, 0) for c in codons)\n        if total == 0:\n            for c in codons:\n                out[c] = 0.0\n            continue\n        expected = total \u002F n_syn\n        for c in codons:\n            out[c] = counts.get(c, 0) \u002F expected if expected else 0.0\n    return out\n```\n\nRSCU > 1 means the codon is used more often than expected; \u003C 1 means less.\n\n### Codon Adaptation Index (CAI)\n\nCAI = geometric mean of relative adaptiveness (weight of each codon = RSCU \u002F max RSCU for that amino acid in the reference set).\n\n```python\nimport math\n\ndef cai(seq: str, ref_counts: dict, table_id: int = 1) -> float:\n    t = CodonTable.unambiguous_dna_by_id[table_id]\n    aa_to = defaultdict(list)\n    for codon, aa in t.forward_table.items():\n        aa_to[aa].append(codon)\n    max_w = {}\n    for aa, codons in aa_to.items():\n        total = sum(ref_counts.get(c, 0) for c in codons)\n        if total == 0:\n            for c in codons:\n                max_w[c] = 0.0\n            continue\n        weights = {c: ref_counts.get(c, 0) \u002F (total \u002F len(codons)) for c in codons}\n        m = max(weights.values()) or 1.0\n        for c, w in weights.items():\n            max_w[c] = w \u002F m\n    s = Seq(seq.upper())\n    if len(s) % 3 != 0:\n        s = s[:len(s) - len(s) % 3]\n    log_sum = 0.0\n    n = 0\n    for i in range(0, len(s), 3):\n        c = str(s[i:i+3])\n        w = max_w.get(c, 0.0)\n        if w > 0:\n            log_sum += math.log(w)\n            n += 1\n    return math.exp(log_sum \u002F n) if n else 0.0\n```\n\nCAI ranges 0-1. Higher = more \"host-like\" codons. > 0.8 is considered highly expressed in the host.\n\n### Effective Number of Codons (ENc)\n\nENc ranges 20 (extreme bias, one codon per amino acid) to 61 (no bias).\nWright 1990 formula:\n\n```python\ndef enc(counts: dict, table_id: int = 1) -> float:\n    from Bio.Data import CodonTable\n    t = CodonTable.unambiguous_dna_by_id[table_id]\n    aa_to = defaultdict(list)\n    for codon, aa in t.forward_table.items():\n        aa_to[aa].append(codon)\n\n    f_vals = []\n    for aa, codons in aa_to.items():\n        n = len(codons)\n        if n == 1:\n            continue\n        total = sum(counts.get(c, 0) for c in codons)\n        if total \u003C= 1:\n            continue\n        # homozygosity F = (n * sum(p_i^2) - 1) \u002F (n - 1)\n        p = [counts.get(c, 0) \u002F total for c in codons]\n        f = (n * sum(pi * pi for pi in p) - 1) \u002F (n - 1)\n        f_vals.append(f)\n\n    # Wright's formula\n    enc = 2 + 9 \u002F (sum(f_vals) \u002F len(f_vals)) if f_vals else 0\n    return enc\n```\n\n### Use a published reference table (E. coli K-12)\n\n```python\n# Kazusa codon usage database provides these as text\n# https:\u002F\u002Fwww.kazusa.or.jp\u002Fcodon\u002F\nECOLI_CODONS = {\n    \"ATG\": 1000,   # example, replace with real counts\n    \"TTT\":  500,\n    # ... full table from Kazusa\n}\n```\n\nFor real work, parse the Kazusa `.txt` file or use `python_codon_tables` (PyPI).\n\n### Codon optimization with DNA Chisel (open source)\n\n```python\nimport dnachisel as dc\n\nproblem = dc.DnaOptimizationProblem(\n    sequence=\"ATGGCCATTGTAATGGGCCGCTGAAAGGGTGCCCGATAG\",\n    constraints=[\n        dc.EnforceTranslation(),\n        dc.EnforceGCContent(mini=0.4, maxi=0.6, window=50),\n        dc.AvoidPattern(\"BsaI_site\"),  # avoid restriction sites\n    ],\n    objectives=[dc.CodonOptimize(species=\"e_coli\")],\n)\nproblem.resolve()\nprint(problem.sequence)  # optimized sequence\n```\n\n### Codon harmonization (preserve original codon bias, not maximize)\n\nFor cross-species expression where the source organism's translation speed pattern matters, \"harmonize\" the sequence to use the destination's most-frequent codon for each amino acid in a way that mimics the source's translational pauses.\n\nTools: `codon harmonization` Python package; CHARMING web server (academic).\n\n## Common pitfalls\n\n- **Computing CAI on the wrong frame.** A multiple-of-3 length is the only frame that produces a real CAI.\n- **RSCU of 0 for a synonymous codon that wasn't observed.** RSCU = 0 means the codon is absent in the reference; not the same as \"disallowed\".\n- **CAI close to 1 doesn't guarantee expression.** It predicts codon *availability* for the tRNA pool, not mRNA stability, protein folding, or toxicity.\n- **Optimizing for codon bias destroys mRNA structure and may introduce rare restriction sites.** Always combine with `EnforceGCContent`, `AvoidPattern`, and structure objectives.\n- **Cross-species CAI comparisons are invalid.** CAI is *relative* to a reference. Pick the host's reference, not the donor's.\n\n## Validation\n\n- CAI is in [0, 1].\n- RSCU values for synonymous codons sum to the number of synonymous codons per amino acid.\n- ENc is in [20, 61].\n- A codon-optimized sequence still translates to the same amino acid sequence (use `translate(to_stop=True)` to verify).\n\n## Open alternatives\n\n| Need | Tool |\n|------|------|\n| Codon optimization | `DNA Chisel`, `GeneDesign` |\n| CAI\u002FRSCU\u002FENc reference tables | `python_codon_tables` (PyPI), Kazusa |\n| Codon harmonization | `codon-harmonization` (PyPI), CHARMING |\n| Expression prediction (ML) | `CodonBERT`, `mRFP` |\n\n## References\n\n- Sharp & Li 1987 (CAI): \u003Chttps:\u002F\u002Fdoi.org\u002F10.1093\u002Fnar\u002F15.3.1281>\n- Wright 1990 (ENc): \u003Chttps:\u002F\u002Fdoi.org\u002F10.1093\u002Fnar\u002F18.1.171>\n- Kazusa codon DB: \u003Chttps:\u002F\u002Fwww.kazusa.or.jp\u002Fcodon\u002F>\n- DNA Chisel: \u003Chttps:\u002F\u002Fgithub.com\u002FEdinburgh-Genome-Foundry\u002FDnaChisel>\n- Companion: `ors-bioinformatics-sequence-transcription-translation`, `ors-bioinformatics-sequence-sequence-properties`.\n\n## Changelog\n\n- 1.0.0 (2026-06-10): Initial adaptation by Pradyumna Jayaram from `bio-codon-usage` (bioSkills-main\u002Fsequence-manipulation\u002Fcodon-usage).\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- compressed-sequence-files\n- fastq-quality-scores\n- filter-sequences\n- format-conversion\n- hisat2-alignment\n- motif-search\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\u002Fcodon-usage",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 codon-usage",{"tool":38,"command":39},"bunx","bunx skills add pradyumnasagar\u002Fopen-research-skills --skill codon-usage",{"tool":41,"command":42},"pnpm","pnpm dlx skills add pradyumnasagar\u002Fopen-research-skills --skill codon-usage","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fpradyumnasagar\u002Fopen-research-skills\u002Fblob\u002Fmain\u002Fskills\u002Fbioinformatics-sequence\u002Fcodon-usage\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",[],[]]