Install any skill in seconds. Free to start, no credit card required.
Get Started Free →Reconstruct ancestral sequences at phylogenetic nodes using PAML and IQ-TREE marginal likelihood methods. Infer ancient protein sequences and trace evolutionary trajectories through sequence history. Use when inferring ancestral states for protein resurrection or tracing evolutionary history.
.claude/skills/bio-comparative-genomics-ancestral-reconstruction/SKILL.md| Test case | Without → With | Effect | Δ tokens | Δ turns |
|---|---|---|---|---|
| case-01 | ✗→✓ | ▲ Improved | 22% | 0% |
| case-02 | ✗→✓ | ▲ Improved | 4% | 0% |
| case-10 | ✗→✓ | ▲ Improved | 49% | 0% |
| case-11 | ✗→✓ | ▲ Improved | 250% | 0% |
| case-12 | ✗→✓ | ▲ Improved | 27% | 0% |
<!--
#
#
-->
python'''Ancestral sequence reconstruction with PAML codeml/baseml''' import subprocess import re from Bio import SeqIO from Bio.Seq import Seq def create_asr_control(alignment, tree, output_dir, seq_type='protein'): '''Create control file for ancestral reconstruction RateAncestor = 1: Enable ancestral reconstruction Generates RST file with ancestral sequences For codons: Use codeml with seqtype = 1 For amino acids: Use codeml with seqtype = 2 For nucleotides: Use baseml ''' if seq_type == 'protein': ctl = f''' seqfile = {alignment} treefile = {tree} outfile = {output_dir}/asr.mlc seqtype = 2 model = 3 aaRatefile = wag.dat RateAncestor = 1 cleandata = 0 ''' else: # codon ctl = f''' seqfile = {alignment} treefile = {tree} outfile = {output_dir}/asr.mlc seqtype = 1 CodonFreq = 2 model = 0 NSsites = 0 RateAncestor = 1 cleandata = 0 ''' ctl_file = f'{output_dir}/asr.ctl' with open(ctl_file, 'w') as f: f.write(ctl) return ctl_file def parse_rst_file(rst_file): '''Parse PAML RST file for ancestral sequences RST contains: - Tree with node numbers - Ancestral sequences at each node - Posterior probabilities for each site Node numbering: Extant sequences first, then internal nodes ''' ancestors = {} current_node = None current_seq = [] with open(rst_file) as f: content = f.read() # Find ancestral sequence section if 'Ancestral reconstruction by' in content: sections = content.split('Ancestral reconstruction by') for section in sections[1:]: lines = section.strip().split('\n') for line in lines: if line.startswith('node #'): if current_node and current_seq: ancestors[current_node] = ''.join(current_seq) match = re.search(r'node #(\d+)', line) if match: current_node = f'Node_{match.group(1)}' current_seq = [] elif current_node and line.strip() and not line.startswith(' '): # Sequence line seq_part = ''.join(line.split()[1:]) if len(line.split()) > 1 else '' current_seq.append(seq_part) if current_node and current_seq: ancestors[current_node] = ''.join(current_seq) return ancestors def extract_marginal_probabilities(rst_file): '''Extract site-wise posterior probabilities High confidence: P > 0.95 (commonly used threshold) Moderate confidence: P > 0.80 Low confidence: P < 0.80 (consider alternatives) Report ambiguous sites for experimental validation ''' site_probs = [] with open(rst_file) as f: in_probs = False for line in f: if 'Prob of best state' in line: in_probs = True continue if in_probs and line.strip(): parts = line.split() if len(parts) >= 3: try: site = int(parts[0]) state = parts[1] prob = float(parts[2]) site_probs.append({ 'site': site, 'state': state, 'probability': prob, 'confidence': 'high' if prob > 0.95 else 'moderate' if prob > 0.8 else 'low' }) except ValueError: in_probs = False return site_probs
pythondef run_iqtree_asr(alignment, tree=None, model='LG+G4', output_prefix='asr'): '''Run IQ-TREE for ancestral sequence reconstruction IQ-TREE provides: - Marginal reconstruction (default) - Joint reconstruction (-asr-joint) - State file (.state) with probabilities Advantages over PAML: - Automatic model selection - Better handling of gaps - Faster for large datasets ''' cmd = f'iqtree2 -s {alignment} -m {model} --ancestral -pre {output_prefix}' if tree: cmd += f' -te {tree}' subprocess.run(cmd, shell=True) return f'{output_prefix}.state' def parse_iqtree_state(state_file): '''Parse IQ-TREE .state file Format: Node Site State Probability [other states and probs] ''' ancestors = {} with open(state_file) as f: next(f) # Skip header for line in f: parts = line.strip().split('\t') if len(parts) >= 4: node = parts[0] site = int(parts[1]) state = parts[2] prob = float(parts[3]) if node not in ancestors: ancestors[node] = {'sequence': [], 'probabilities': []} ancestors[node]['sequence'].append(state) ancestors[node]['probabilities'].append(prob) # Convert to sequences for node in ancestors: ancestors[node]['sequence'] = ''.join(ancestors[node]['sequence']) return ancestors
pythondef get_alternative_states(site_probs, threshold=0.1): '''Identify sites with plausible alternative ancestral states Alternative states with P > 0.1 should be considered for experimental validation (ancestral protein resurrection) These sites may: - Affect function differently - Represent true ancestral ambiguity - Be targets for directed evolution ''' ambiguous_sites = [] for site_data in site_probs: if 'alternatives' in site_data: significant_alts = [ alt for alt in site_data['alternatives'] if alt['probability'] > threshold ] if significant_alts: ambiguous_sites.append({ 'site': site_data['site'], 'best_state': site_data['state'], 'best_prob': site_data['probability'], 'alternatives': significant_alts }) return ambiguous_sites def calculate_sequence_confidence(site_probs): '''Calculate overall confidence in ancestral sequence Metrics: - Mean posterior probability - Fraction of high-confidence sites (P > 0.95) - Number of ambiguous positions ''' if not site_probs: return None probs = [s['probability'] for s in site_probs] high_conf = sum(1 for p in probs if p > 0.95) / len(probs) low_conf = sum(1 for p in probs if p < 0.8) return { 'mean_probability': sum(probs) / len(probs), 'high_confidence_fraction': high_conf, 'low_confidence_sites': low_conf, 'total_sites': len(probs), 'overall_quality': 'high' if high_conf > 0.9 else 'moderate' if high_conf > 0.7 else 'low' }
pythondef design_asr_construct(ancestral_seq, extant_reference, ambiguous_sites): '''Design constructs for ancestral protein resurrection Strategy: 1. Use most probable state at each position 2. Create alternative constructs at ambiguous sites 3. Consider codon optimization for expression host Validation: - Test activity of resurrected proteins - Compare to extant proteins - Test alternative constructs at ambiguous positions ''' constructs = [{'name': 'ASR_ML', 'sequence': ancestral_seq, 'description': 'Maximum likelihood ancestral'}] # Create alternative constructs for ambiguous sites for site in ambiguous_sites[:5]: # Limit to top 5 ambiguous alt_seq = list(ancestral_seq) best_alt = site['alternatives'][0] alt_seq[site['site'] - 1] = best_alt['state'] constructs.append({ 'name': f"ASR_alt_{site['site']}", 'sequence': ''.join(alt_seq), 'description': f"Alternative at position {site['site']}: {best_alt['state']}" }) return constructs
<!-- AUTHOR_SIGNATURE: 9a7f3c2e-MD-BABU-MIA-2026-MSSM-SECURE -->
| Case | Status | Duration (ms) | Turns | Tokens | Tool calls | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Without | With | Δ | Without | With | Δ | Without | With | Δ | Without | With | Δ | ||
case-07 | pass→pass | 4,688 | 3,147 | -33% | 1 | 1 | 0% | 831 | 2,741 | +230% | 0 | 0 | — |
case-01 | fail→pass | 27,777 | 6,547 | -76% | 1 | 1 | 0% | 3,029 | 3,694 | +22% | 0 | 0 | — |
case-02 | fail→pass | 26,681 | 14,237 | -47% | 1 | 1 | 0% | 5,165 | 5,348 | +4% | 0 | 0 | — |
case-03 | pass→pass | 14,261 | 10,810 | -24% | 1 | 1 | 0% | 2,736 | 4,431 | +62% | 0 | 0 | — |
case-04 | pass→fail | 4,866 | 2,462 | -49% | 1 | 1 | 0% | 775 | 2,689 | +247% | 0 | 0 | — |
case-05 | pass→pass | 16,890 | 7,491 | -56% | 1 | 1 | 0% | 3,221 | 3,911 | +21% | 0 | 0 | — |
case-06 | fail→fail | 11,242 | 6,101 | -46% | 1 | 1 | 0% | 2,214 | 3,554 | +61% | 0 | 0 | — |
case-08 | pass→pass | 13,477 | 10,614 | -21% | 1 | 1 | 0% | 2,827 | 4,465 | +58% | 0 | 0 | — |
case-09 | fail→fail | 18,012 | 13,135 | -27% | 1 | 1 | 0% | 3,468 | 4,985 | +44% | 0 | 0 | — |
case-10 | fail→pass | 12,085 | 6,624 | -45% | 1 | 1 | 0% | 2,572 | 3,823 | +49% | 0 | 0 | — |
case-11 | fail→pass | 16,686 | 2,775 | -83% | 1 | 1 | 0% | 803 | 2,809 | +250% | 0 | 0 | — |
case-12 | fail→pass | 13,451 | 3,761 | -72% | 1 | 1 | 0% | 2,481 | 3,154 | +27% | 0 | 0 | — |
case-13 | fail→pass | 13,478 | 2,338 | -83% | 1 | 1 | 0% | 2,212 | 2,730 | +23% | 0 | 0 | — |
case-14 | fail→pass | 28,460 | 2,874 | -90% | 1 | 1 | 0% | 2,313 | 2,891 | +25% | 0 | 0 | — |
case-15 | pass→pass | 4,863 | 3,056 | -37% | 1 | 1 | 0% | 797 | 2,821 | +254% | 0 | 0 | — |
case-16 | fail→pass | 8,401 | 4,050 | -52% | 1 | 1 | 0% | 1,669 | 3,183 | +91% | 0 | 0 | — |
case-17 | fail→pass | 27,751 | 1,772 | -94% | 1 | 1 | 0% | 2,319 | 2,628 | +13% | 0 | 0 | — |
case-18 | pass→pass | 7,048 | 5,343 | -24% | 1 | 1 | 0% | 1,333 | 3,126 | +135% | 0 | 0 | — |
case-19 | pass→pass | 10,801 | 4,411 | -59% | 1 | 1 | 0% | 2,012 | 3,119 | +55% | 0 | 0 | — |
case-20 | pass→pass | 16,060 | 12,735 | -21% | 1 | 1 | 0% | 3,409 | 5,285 | +55% | 0 | 0 | — |
case-21 | pass→pass | 15,791 | 12,063 | -24% | 1 | 1 | 0% | 3,533 | 4,947 | +40% | 0 | 0 | — |
case-22 | fail→pass | 22,708 | 6,336 | -72% | 1 | 1 | 0% | 1,017 | 3,563 | +250% | 0 | 0 | — |
case-23 | pass→pass | 7,715 | 6,298 | -18% | 1 | 1 | 0% | 1,691 | 3,536 | +109% | 0 | 0 | — |
DecimalAI ran this skill against gemini-3.6-flash twice over the same eval suite — once with the skill loaded and once without — and compared the two runs case by case. 23 cases were attempted, and 20 counted toward the lift figure. The other 3 produced results that are not comparable between the two arms, so they are excluded from the headline rather than averaged into it. The headline lift of +39 percentage points is the difference between those two pass rates over the 20 comparable cases. 1 case got worse with the skill loaded, and it is included in that figure.
Without the skill loaded, the model failed this case. With it loaded, the same prompt on the same model passed. This is one improved case from the latest verified run; every case, including any that regressed, is in the table above.
| Model | Method | Date | Lift |
|---|---|---|---|
| gemini-3.6-flash | verified | 7/24/2026 | +50% |
Other measured skills in the registry, with their headline benchmark lift.