Corpus Engine Towards a reproducible .science file.
← All .science files

pmid:40924543

HIPSTR: highest independent posterior subtree reconstruction in TreeAnnotator X.

Guy Baele · Luiz M Carvalho · Marius Brusselmans · Gytis Dudas · Xiang Ji · John T McCrone · Philippe Lemey · Marc A Suchard · Andrew Rambaut

Bioinformatics (Oxford, England) · 2025 doi:10.1093/bioinformatics/btaf488

Paper

complete

Experiment

partial

Data

partial

Analysis

partial

Execution

absent

Execution evidence has not yet been added to this .science file. Explore its methods, data and open questions to plan the next step.
Record details sci_version · id · kind · revision · content_hash · schema · created_at · updated_at · generator
id
pmid:40924543
kind
science-record
content_hash
sha256:8403ed9180aff622727a14a3fce1175df252cde1c1cc917858a32ece84a8e54a
schema
https://corpus.bntrg.co.uk/sci/1.0/sci.schema.json
created_at
2026-11-01T20:31:01Z
updated_at
2026-11-01T21:35:45Z
generator object · 2 fields
name
corpus-assay-engine
run_id
reading-sci-2026-11-01
paper object · 10 fields
state
complete
title
HIPSTR: highest independent posterior subtree reconstruction in TreeAnnotator X.
doi
10.1093/bioinformatics/btaf488
pmid
40924543
authors array · 9 items
[0]
Guy Baele
[1]
Luiz M Carvalho
[2]
Marius Brusselmans
[3]
Gytis Dudas
[4]
Xiang Ji
[5]
John T McCrone
[6]
Philippe Lemey
[7]
Marc A Suchard
[8]
Andrew Rambaut
journal
Bioinformatics (Oxford, England)
year
2025
abstract
SUMMARY: In Bayesian phylogenetic and phylodynamic studies, it is common to summarize the posterior distribution of trees with a time-calibrated summary phylogeny. While the maximum clade credibility (MCC) tree is often used for this purpose, we here show that a novel summary tree method-the highest independent posterior subtree reconstruction, or (HIPSTR)-contains consistently higher supported clades over MCC. We also provide faster computational routines for estimating both summary trees in an updated version of TreeAnnotator X, an open-source software program that summarizes the information from a sample of trees and returns many helpful statistics such as individual clade credibilities contained in the summary tree. RESULTS: HIPSTR and MCC reconstructions on two Ebola virus and two SARS-CoV-2 datasets show that HIPSTR yields summary trees that consistently contain clades with higher support compared to MCC trees. The MCC trees regularly fail to include several clades with very high posterior probability (≥0.95) as well as a large number of clades with moderate to high posterior probability (≥50%), whereas HIPSTR-in particular its majority-rule extension MrHIPSTR-achieves near-perfect performance in this respect. HIPSTR and MrHIPSTR also exhibit favourable computational performance over MCC in TreeAnnotator X. Comparison to the recent CCD0-MAP algorithm yielded mixed results and requires a more in-depth investigation in follow-up studies. AVAILABILITY AND IMPLEMENTATION: TreeAnnotator X is available as part of the BEAST X (v10.5.0) software package, available at https://github.com/beast-dev/beast-mcmc/releases, and on Zenodo (DOI: https://doi.org/10.5281/zenodo.4895234).
claims array · 3 items
[0] object · 6 fields
id
claim-method
statement
We here propose a summary tree approach—the highest independent posterior subtree reconstruction (HIPSTR) algorithm—that attempts to address the limitations of both majority-rule consensus trees and MCC trees.
kind
methodological
target
null
evidence array · 1 item
[0] object · 3 fields
asset
source:pmid:40924543
locator
sections[1] "1 Introduction" paragraph 7
quote
We here propose a summary tree approach—the highest independent posterior subtree reconstruction (HIPSTR) algorithm—that attempts to address the limitations of both majority-rule consensus trees and MCC trees.
state
complete
[1] object · 6 fields
id
claim-data-access
statement
No new data were generated or analysed in support of this research.
kind
methodological
target
null
evidence array · 1 item
[0] object · 3 fields
asset
source:pmid:40924543
locator
sections[12] "Data availability" paragraph 2
quote
No new data were generated or analysed in support of this research.
state
complete
[2] object · 6 fields
id
claim-target-result
statement
HIPSTR consistently yields summary trees with higher log marginal clade credibility and mean individual clade credibility over MCC trees, while doing so in a markedly shorter time compared to the MCC algorithm.
kind
qualitative
target
null
evidence array · 2 items
[0] object · 3 fields
asset
source:pmid:40924543
locator
sections[6] "3 Results" paragraph 2
quote
HIPSTR consistently yields summary trees with higher log marginal clade credibility and mean individual clade credibility over MCC trees, while doing so in a markedly shorter time compared to the MCC algorithm.
[1] object · 3 fields
asset
source:pmid:40924543
locator
sections[6] "3 Results" paragraph 4
quote
On the datasets tested HIPSTR and MrHIPSTR perform up to 2× faster than MCC.
state
complete
gaps array · 0 items
experiment object · 8 fields
state
partial
objective
HIPSTR consistently yields summary trees with higher log marginal clade credibility and mean individual clade credibility over MCC trees, while doing so in a markedly shorter time compared to the MCC algorithm.
steps array · 3 items
[0] object · 13 fields
id
read_published_estimate
order
1
name
Read the published estimate from the source
kind
other
state
complete
blocked_on
null
description
The claim, method and evidence span published with the source article.
parameters object · 0 fields
inputs array · 1 item
[0]
source:pmid:40924543
outputs array · 1 item
[0]
the published estimate and its evidence
instruments array · 0 items
reagents array · 0 items
[1] object · 13 fields
id
obtain_source_data
order
2
name
Obtain the source data from the named repository
kind
data-preparation
state
blocked
blocked_on
data:accession_absent
description
The GEO series accession resolves and its sample accessions are listed. This lane did not download the dataset or read its licence.
parameters object · 0 fields
inputs array · 0 items
outputs array · 1 item
[0]
the source data with its repository provenance
instruments array · 0 items
reagents array · 0 items
[2] object · 13 fields
id
run_analysis
order
3
name
Run the published analysis
kind
analysis
state
complete
blocked_on
null
description
Apply the paper's statistical method to the resolved series and compare the result with the published target.
parameters object · 0 fields
inputs array · 0 items
outputs array · 1 item
[0]
the replicated result and its comparison
instruments array · 0 items
reagents array · 0 items
materials array · 0 items
instruments array · 0 items
reagents array · 0 items
conditions object · 0 fields
gaps array · 1 item
[0]
step:obtain_source_data blocked on data:accession_absent
data object · 3 fields
state
partial
assets array · 1 item
[0] object · 15 fields
id
source:pmid:40924543
role
manuscript
format
xml
media_type
application/xml
uri
https://doi.org/10.1093/bioinformatics/btaf488
sha256
sha256:ae7d72f4d87f2bb95814a91a72ae17ec20e2eaa5204f20d571dde8e9e7454e7e
bytes
28647
access
open
state
resolved
reader
null
reader_status
reader_required
identifier
10.1093/bioinformatics/btaf488
version
null
note
Full article fetched from PMC; the checksum covers the rendered section body, not the original XML bytes.
structure object · 4 fields
pmcid
PMC12490824
source
europe_pmc_fulltext
coverage
whole_body
text_hash_scope
rendered_section_body
gaps array · 0 items
analysis object · 4 fields
state
partial
methods array · 1 item
[0] object · 10 fields
id
method-1
family
null
specific
null
label
highest independent posterior subtree reconstruction (HIPSTR) and its majority-rule extension MrHIPSTR
dsl_operations array · 0 items
missing_operations array · 0 items
parameters object · 0 fields
data_shapes array · 0 items
evidence object · 3 fields
score
1
band
verbatim
quote
We here propose a summary tree approach—the highest independent posterior subtree reconstruction (HIPSTR) algorithm—that attempts to address the limitations of both majority-rule consensus trees and MCC trees.
targets array · 0 items
gaps array · 1 item
[0]
method.reader_named_unmapped
capability object · 3 fields
state
complete
requirements array · 1 item
[0] object · 6 fields
capability_id
capability:computational_analysis
label
Computational analysis platform
assay_families array · 9 items
[0]
meta_analysis
[1]
machine_learning
[2]
survival_analysis
[3]
statistical_regression
[4]
pca
[5]
molecular_docking
[6]
network_analysis
[7]
differential_expression
[8]
gwas
candidate
Automated Assays Laravel application and simulated adapters
gaps array · 0 items
readiness object · 8 fields
state
blocked
tier
R4
blocked_on
data:accession_absent
axes object · 3 fields
method object · 5 fields
tier
R4
expressible
false
required_operations array · 0 items
missing_operations array · 0 items
basis
The reader quoted the method the paper names (highest independent posterior subtree reconstruction (HIPSTR) and its majority-rule extension MrHIPSTR), but the corpus's method extractor could not map it onto a DSL operation, so the method is published but not expressible.
capability object · 4 fields
tier
R1
capability_id
capability:computational_analysis
availability_state
owned
basis
The computational analysis is owned. The physical bench the paper used is not, so a physical validation cannot be run here.
data object · 6 fields
tier
R4
reachable
false
accessions array · 0 items
resolved_accessions array · 0 items
statements array · 1 item
[0]
No new data were generated or analysed in support of this research.
basis
The paper names no accession to its source data, so the data has to come from the authors.
can_run object · 3 fields
dsl_operations array · 0 items
assets array · 1 item
[0]
source:pmid:40924543
steps array · 1 item
[0]
run_analysis
must_build object · 5 fields
dsl_operations array · 0 items
converters array · 0 items
readers array · 0 items
capabilities array · 0 items
data_gaps array · 1 item
[0]
data:geo:None
gaps array · 1 item
[0]
data:accession_absent
review object · 5 fields
state
partial
machine_critique object · 5 fields
kind
extraction_review
reader object · 5 fields
model
MiniMax-M3.1-Flash
provider
minimax
provider_family
minimax
read_at
2026-11-01T20:01:23Z
independence
single_reader
evidence_check object · 2 fields
method
verbatim
availability
verbatim
calls
5
usage object · 3 fields
prompt_tokens
8378
completion_tokens
1728
cached_tokens
256
stages array · 1 item
[0] object · 4 fields
id
extraction
state
complete
reader
MiniMax-M3.1-Flash
provider
minimax
gaps array · 3 items
[0]
review.independent_reader
[1]
review.machine_critique
[2]
review.human_critique
execution object · 5 fields
state
absent
status
not_run
mode
null
runs array · 0 items
gaps array · 1 item
[0]
execution.not_run
provenance object · 7 fields
entities array · 3 items
[0] object · 3 fields
id
pmid:40924543
type
paper
label
pmid:40924543
[1] object · 3 fields
id
source:pmid:40924543
type
manuscript
label
PMID 40924543 full text
[2] object · 3 fields
id
data:geo:None
type
dataset
label
GEO None
activities array · 3 items
[0] object · 4 fields
id
activity-reading-sci-2026-11-01
type
classification
used array · 3 items
[0] object · 3 fields
id
pmid:40924543
type
paper
label
pmid:40924543
[1] object · 3 fields
id
source:pmid:40924543
type
manuscript
label
PMID 40924543 full text
[2] object · 3 fields
id
data:geo:None
type
dataset
label
GEO None
agent
agent:corpus-assay-engine
[1] object · 4 fields
id
activity-read-40924543
type
extraction
used array · 1 item
[0]
source:pmid:40924543
agent
agent:minimax-reader
[2] object · 4 fields
id
activity-resolve-None
type
accession_resolution
used array · 1 item
[0]
data:geo:None
agent
agent:corpus-assay-engine
agents array · 2 items
[0] object · 3 fields
id
agent:corpus-assay-engine
type
software
label
Corpus assay engine
[1] object · 3 fields
id
agent:minimax-reader
type
software
label
MiniMax literature reader
source_run_id
reading-sci-2026-11-01
dsl_catalogue_fingerprint
343fb30756ba6ec3
capability_table_fingerprint
2cb3e42f047d2ecf
snapshot_id
ba34b49490d9bfaf
lineage object · 4 fields
parent_id
pmid:40924543
parent_hash
sha256:93bd91e39b5cb26edefd379abb64fc69784ad2cad147ae8e8a2586e642e4a4c4
fork_of
null
gaps array · 6 items
[0]
execution.not_run
[1]
method.reader_named_unmapped
[2]
review.human_critique
[3]
review.independent_reader
[4]
review.machine_critique
[5]
step:obtain_source_data blocked on data:accession_absent
Complete file
{"sci_version": "1.0", "schema": "https://corpus.bntrg.co.uk/sci/1.0/sci.schema.json", "id": "pmid:40924543", "kind": "science-record", "revision": 2, "content_hash": "sha256:8403ed9180aff622727a14a3fce1175df252cde1c1cc917858a32ece84a8e54a", "created_at": "2026-11-01T20:31:01Z", "updated_at": "2026-11-01T21:35:45Z", "generator": {"name": "corpus-assay-engine", "run_id": "reading-sci-2026-11-01"}, "paper": {"state": "complete", "title": "HIPSTR: highest independent posterior subtree reconstruction in TreeAnnotator X.", "doi": "10.1093/bioinformatics/btaf488", "pmid": "40924543", "authors": ["Guy Baele", "Luiz M Carvalho", "Marius Brusselmans", "Gytis Dudas", "Xiang Ji", "John T McCrone", "Philippe Lemey", "Marc A Suchard", "Andrew Rambaut"], "journal": "Bioinformatics (Oxford, England)", "year": 2025, "abstract": "SUMMARY: In Bayesian phylogenetic and phylodynamic studies, it is common to summarize the posterior distribution of trees with a time-calibrated summary phylogeny. While the maximum clade credibility (MCC) tree is often used for this purpose, we here show that a novel summary tree method-the highest independent posterior subtree reconstruction, or (HIPSTR)-contains consistently higher supported clades over MCC. We also provide faster computational routines for estimating both summary trees in an updated version of TreeAnnotator X, an open-source software program that summarizes the information from a sample of trees and returns many helpful statistics such as individual clade credibilities contained in the summary tree.\nRESULTS: HIPSTR and MCC reconstructions on two Ebola virus and two SARS-CoV-2 datasets show that HIPSTR yields summary trees that consistently contain clades with higher support compared to MCC trees. The MCC trees regularly fail to include several clades with very high posterior probability (≥0.95) as well as a large number of clades with moderate to high posterior probability (≥50%), whereas HIPSTR-in particular its majority-rule extension MrHIPSTR-achieves near-perfect performance in this respect. HIPSTR and MrHIPSTR also exhibit favourable computational performance over MCC in TreeAnnotator X. Comparison to the recent CCD0-MAP algorithm yielded mixed results and requires a more in-depth investigation in follow-up studies.\nAVAILABILITY AND IMPLEMENTATION: TreeAnnotator X is available as part of the BEAST X (v10.5.0) software package, available at https://github.com/beast-dev/beast-mcmc/releases, and on Zenodo (DOI: https://doi.org/10.5281/zenodo.4895234).", "claims": [{"id": "claim-method", "statement": "We here propose a summary tree approach—the highest independent posterior subtree reconstruction (HIPSTR) algorithm—that attempts to address the limitations of both majority-rule consensus trees and MCC trees.", "kind": "methodological", "target": null, "evidence": [{"asset": "source:pmid:40924543", "locator": "sections[1] \"1 Introduction\" paragraph 7", "quote": "We here propose a summary tree approach—the highest independent posterior subtree reconstruction (HIPSTR) algorithm—that attempts to address the limitations of both majority-rule consensus trees and MCC trees."}], "state": "complete"}, {"id": "claim-data-access", "statement": "No new data were generated or analysed in support of this research.", "kind": "methodological", "target": null, "evidence": [{"asset": "source:pmid:40924543", "locator": "sections[12] \"Data availability\" paragraph 2", "quote": "No new data were generated or analysed in support of this research."}], "state": "complete"}, {"id": "claim-target-result", "statement": "HIPSTR consistently yields summary trees with higher log marginal clade credibility and mean individual clade credibility over MCC trees, while doing so in a markedly shorter time compared to the MCC algorithm.", "kind": "qualitative", "target": null, "evidence": [{"asset": "source:pmid:40924543", "locator": "sections[6] \"3 Results\" paragraph 2", "quote": "HIPSTR consistently yields summary trees with higher log marginal clade credibility and mean individual clade credibility over MCC trees, while doing so in a markedly shorter time compared to the MCC algorithm."}, {"asset": "source:pmid:40924543", "locator": "sections[6] \"3 Results\" paragraph 4", "quote": "On the datasets tested HIPSTR and MrHIPSTR perform up to 2× faster than MCC."}], "state": "complete"}], "gaps": []}, "experiment": {"state": "partial", "objective": "HIPSTR consistently yields summary trees with higher log marginal clade credibility and mean individual clade credibility over MCC trees, while doing so in a markedly shorter time compared to the MCC algorithm.", "steps": [{"id": "read_published_estimate", "order": 1, "name": "Read the published estimate from the source", "kind": "other", "state": "complete", "blocked_on": null, "description": "The claim, method and evidence span published with the source article.", "duration_hours": null, "parameters": {}, "inputs": ["source:pmid:40924543"], "outputs": ["the published estimate and its evidence"], "instruments": [], "reagents": []}, {"id": "obtain_source_data", "order": 2, "name": "Obtain the source data from the named repository", "kind": "data-preparation", "state": "blocked", "blocked_on": "data:accession_absent", "description": "The GEO series accession resolves and its sample accessions are listed. This lane did not download the dataset or read its licence.", "duration_hours": null, "parameters": {}, "inputs": [], "outputs": ["the source data with its repository provenance"], "instruments": [], "reagents": []}, {"id": "run_analysis", "order": 3, "name": "Run the published analysis", "kind": "analysis", "state": "complete", "blocked_on": null, "description": "Apply the paper's statistical method to the resolved series and compare the result with the published target.", "duration_hours": null, "parameters": {}, "inputs": [], "outputs": ["the replicated result and its comparison"], "instruments": [], "reagents": []}], "materials": [], "instruments": [], "reagents": [], "conditions": {}, "gaps": ["step:obtain_source_data blocked on data:accession_absent"]}, "data": {"state": "partial", "assets": [{"id": "source:pmid:40924543", "role": "manuscript", "format": "xml", "media_type": "application/xml", "uri": "https://doi.org/10.1093/bioinformatics/btaf488", "sha256": "sha256:ae7d72f4d87f2bb95814a91a72ae17ec20e2eaa5204f20d571dde8e9e7454e7e", "bytes": 28647, "access": "open", "state": "resolved", "reader": null, "reader_status": "reader_required", "identifier": "10.1093/bioinformatics/btaf488", "version": null, "note": "Full article fetched from PMC; the checksum covers the rendered section body, not the original XML bytes.", "structure": {"pmcid": "PMC12490824", "source": "europe_pmc_fulltext", "coverage": "whole_body", "text_hash_scope": "rendered_section_body"}}], "gaps": []}, "analysis": {"state": "partial", "methods": [{"id": "method-1", "family": null, "specific": null, "label": "highest independent posterior subtree reconstruction (HIPSTR) and its majority-rule extension MrHIPSTR", "dsl_operations": [], "missing_operations": [], "expressible": null, "parameters": {}, "data_shapes": [], "evidence": {"score": 1.0, "band": "verbatim", "quote": "We here propose a summary tree approach—the highest independent posterior subtree reconstruction (HIPSTR) algorithm—that attempts to address the limitations of both majority-rule consensus trees and MCC trees."}}], "targets": [], "gaps": ["method.reader_named_unmapped"]}, "capability": {"state": "complete", "requirements": [{"capability_id": "capability:computational_analysis", "label": "Computational analysis platform", "assay_families": ["meta_analysis", "machine_learning", "survival_analysis", "statistical_regression", "pca", "molecular_docking", "network_analysis", "differential_expression", "gwas"], "availability_state": "owned", "tier_unlocked": "R1", "candidate": "Automated Assays Laravel application and simulated adapters"}], "gaps": []}, "readiness": {"state": "blocked", "tier": "R4", "blocking_axis": "data", "blocked_on": "data:accession_absent", "axes": {"method": {"tier": "R4", "expressible": false, "required_operations": [], "missing_operations": [], "basis": "The reader quoted the method the paper names (highest independent posterior subtree reconstruction (HIPSTR) and its majority-rule extension MrHIPSTR), but the corpus's method extractor could not map it onto a DSL operation, so the method is published but not expressible."}, "capability": {"tier": "R1", "capability_id": "capability:computational_analysis", "availability_state": "owned", "basis": "The computational analysis is owned. The physical bench the paper used is not, so a physical validation cannot be run here."}, "data": {"tier": "R4", "reachable": false, "accessions": [], "resolved_accessions": [], "statements": ["No new data were generated or analysed in support of this research."], "basis": "The paper names no accession to its source data, so the data has to come from the authors."}}, "can_run": {"dsl_operations": [], "assets": ["source:pmid:40924543"], "steps": ["run_analysis"]}, "must_build": {"dsl_operations": [], "converters": [], "readers": [], "capabilities": [], "data_gaps": ["data:geo:None"]}, "gaps": ["data:accession_absent"]}, "review": {"state": "partial", "machine_critique": {"kind": "extraction_review", "reader": {"model": "MiniMax-M3.1-Flash", "provider": "minimax", "provider_family": "minimax", "read_at": "2026-11-01T20:01:23Z", "independence": "single_reader"}, "evidence_check": {"method": "verbatim", "availability": "verbatim"}, "calls": 5, "usage": {"prompt_tokens": 8378, "completion_tokens": 1728, "cached_tokens": 256}}, "human_critique": null, "stages": [{"id": "extraction", "state": "complete", "reader": "MiniMax-M3.1-Flash", "provider": "minimax"}], "gaps": ["review.independent_reader", "review.machine_critique", "review.human_critique"]}, "execution": {"state": "absent", "status": "not_run", "mode": null, "runs": [], "gaps": ["execution.not_run"]}, "provenance": {"entities": [{"id": "pmid:40924543", "type": "paper", "label": "pmid:40924543"}, {"id": "source:pmid:40924543", "type": "manuscript", "label": "PMID 40924543 full text"}, {"id": "data:geo:None", "type": "dataset", "label": "GEO None"}], "activities": [{"id": "activity-reading-sci-2026-11-01", "type": "classification", "used": [{"id": "pmid:40924543", "type": "paper", "label": "pmid:40924543"}, {"id": "source:pmid:40924543", "type": "manuscript", "label": "PMID 40924543 full text"}, {"id": "data:geo:None", "type": "dataset", "label": "GEO None"}], "agent": "agent:corpus-assay-engine"}, {"id": "activity-read-40924543", "type": "extraction", "used": ["source:pmid:40924543"], "agent": "agent:minimax-reader"}, {"id": "activity-resolve-None", "type": "accession_resolution", "used": ["data:geo:None"], "agent": "agent:corpus-assay-engine"}], "agents": [{"id": "agent:corpus-assay-engine", "type": "software", "label": "Corpus assay engine"}, {"id": "agent:minimax-reader", "type": "software", "label": "MiniMax literature reader"}], "source_run_id": "reading-sci-2026-11-01", "dsl_catalogue_fingerprint": "343fb30756ba6ec3", "capability_table_fingerprint": "2cb3e42f047d2ecf", "snapshot_id": "ba34b49490d9bfaf"}, "lineage": {"parent_id": "pmid:40924543", "parent_hash": "sha256:93bd91e39b5cb26edefd379abb64fc69784ad2cad147ae8e8a2586e642e4a4c4", "fork_of": null, "generation": 1}, "gaps": ["execution.not_run", "method.reader_named_unmapped", "review.human_critique", "review.independent_reader", "review.machine_critique", "step:obtain_source_data blocked on data:accession_absent"]}