Evidence map›Paper›PMID 36875213›Full record

ArticleData in brief2023

Data on the solution and processing time reached when constructing a phylogenetic tree using a quantum-inspired computer.

Wataru Onodera, Nobuyuki Hara, Shiho Aoki, Toru Asahi, Naoya Sawamura

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Data in brief, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Wataru OnoderaFaculty of Science and Engineering, Waseda University, TWIns, 2-2 Wakamatsu, Shinjuku, Tokyo 162-8480, Japan.
Nobuyuki HaraFujitsu Ltd. Kanagawa 211-8588, Japan.
Shiho AokiFaculty of Science and Engineering, Waseda University, TWIns, 2-2 Wakamatsu, Shinjuku, Tokyo 162-8480, Japan.
Toru AsahiFaculty of Science and Engineering, Waseda University, TWIns, 2-2 Wakamatsu, Shinjuku, Tokyo 162-8480, Japan.
Naoya SawamuraResearch Organization for Nano & Life Innovation, Waseda University, Japan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Phylogenetic trees provide insight into the evolutionary trajectories of species and molecules. However, because (2n-5)! Phylogenetic trees can be constructed from a dataset containing n sequences, but this method of phylogenetic tree construction is not ideal from the viewpoint of a combinatorial explosion to determine the optimal tree using brute force. Therefore, we developed a method for constructing a phylogenetic tree using a Fujitsu Digital Annealer, a quantum-inspired computer that solves combinatorial optimization problems at a high speed. Specifically, phylogenetic trees are generated by repeating the process of partitioning a set of sequences into two parts (

Indexed as

Distance-matrix methodGraph cutPhylogenetic reconstructionQuantum-inspired computing

Identifiers

PMID36875213
PMCPMC9978462

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.