ArticleActa crystallographica. Section A, Foundations and advances2025
The phase-seeding method for solving non-centrosymmetric crystal structures: a challenge for artificial intelligence.
Article in Acta crystallographica. Section A, Foundations and advances, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.
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.
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.
Who cites it
4 citing papers in PubMed.
- GraPhAI: Neural Networks for Solving Centrosymmetric Crystal Structures.Journal of the American Chemical Society · 2026Article
- Desensitization of the Cardiac Troponin Complex by TnI Phosphorylation and Epigallocatechin-3-Gallate.ACS omega · 2026Article
- Completion of partial structures using Patterson maps with the CrysFormer machine-learning model.Acta crystallographica. Section D, Structural biology · 2025Article
- The AI-based phase-seeding (AI-PhaSeed) method: early applications and statistical analysis.Journal of applied crystallography · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
The overall crystallographic process involves acquiring experimental data and using crystallographic software to find the structure solution. Unfortunately, while diffracted intensities can be measured, the corresponding phases - needed to determine atomic positions - remain experimentally inaccessible (phase problem). Direct methods and the Patterson approach have been successful in solving crystal structures but face limitations with large structures or low-resolution data. Current artificial intelligence (AI) based approaches, such as those recently developed by Larsen et al. [Science (2024), 385, 522-528], have been applied with success to solve centrosymmetric structures, where the phase is binary (0 or π). The current work proposes a new phasing method designed for AI integration, applicable also to non-centrosymmetric structures, where the phase is a continuous variable. The approach involves discretizing the initial phase values for non-centrosymmetric structures into a few distinct values (e.g. values corresponding to the four quadrants). This reduces the complex phase problem from a continuous regression task to a multi-class classification problem, where only a few phase seed values need to be determined. This discretization allows the use of a smaller training dataset for deep learning models, reducing computational complexity. Our feasibility study results show that this method can effectively solve small, medium and large structures, with the minimum percentage of phase seeds (three or four points in the interval [0, 2π]), and 10% to 30% of seed symmetry-independent reflections. This phase-seeding method has the potential to extend AI-based approaches to solve crystal structures ab initio, regardless of complexity or symmetry, by combining AI classification algorithms with classical phasing procedures.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.