首页 > 最新文献

ArXiv最新文献

英文 中文
Learning temporal relationships between symbols with Laplace Neural Manifolds. 时间RL的基础。
Pub Date : 2024-09-22
Marc W Howard, Zahra Gh Esfahani, Bao Le, Per B Sederberg

Firing across populations of neurons in many regions of the mammalian brain maintains a temporal memory, a neural timeline of the recent past. Behavioral results demonstrate that people can both remember the past and anticipate the future over an analogous internal timeline. This paper presents a mathematical framework for building this timeline of the future. We assume that the input to the system is a time series of symbols-sparse tokenized representations of the present-in continuous time. The goal is to record pairwise temporal relationships between symbols over a wide range of time scales. We assume that the brain has access to a temporal memory in the form of the real Laplace transform. Hebbian associations with a diversity of synaptic time scales are formed between the past timeline and the present symbol. The associative memory stores the convolution between the past and the present. Knowing the temporal relationship between the past and the present allows one to infer relationships between the present and the future. With appropriate normalization, this Hebbian associative matrix can store a Laplace successor representation and a Laplace predecessor representation from which measures of temporal contingency can be evaluated. The diversity of synaptic time constants allows for learning of non-stationary statistics as well as joint statistics between triplets of symbols. This framework synthesizes a number of recent neuroscientific findings including results from dopamine neurons in the mesolimbic forebrain.

神经科学和心理学的最新进展表明,大脑可以获得过去和未来的时间线。在哺乳动物大脑许多区域的神经元群中进行Spiking可以保持强大的时间记忆,这是最近的神经时间线。行为结果表明,人们可以估计未来的扩展时间模型,这表明过去的神经时间线可以从现在延伸到未来。本文提出了一个数学框架,用于学习和表达连续时间内事件之间的关系。我们假设大脑可以访问最近过去的真实拉普拉斯变换形式的时间记忆。在过去和现在之间形成了具有多种突触时间尺度的Hebbian联想,记录了事件之间的时间关系。了解过去和现在之间的时间关系可以预测现在和未来之间的关系,从而构建对未来的扩展时间预测。过去的记忆和预测的未来都用真实的拉普拉斯变换来表示,用不同速率常数s索引的神经元群体的放电速率来表示。突触时间尺度的多样性允许在更大的试验历史时间尺度上进行时间记录。在这个框架中,可以通过拉普拉斯时间差来评估时间信用分配。拉普拉斯时间差将实际跟随刺激的未来与在观察到刺激之前预测的未来进行比较。这个计算框架做出了一些特定的神经生理学预测,综合起来,可以为RL的未来迭代提供基础,该迭代将时间记忆作为基本的构建块。
{"title":"Learning temporal relationships between symbols with Laplace Neural Manifolds.","authors":"Marc W Howard, Zahra Gh Esfahani, Bao Le, Per B Sederberg","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Firing across populations of neurons in many regions of the mammalian brain maintains a temporal memory, a neural timeline of the recent past. Behavioral results demonstrate that people can both remember the past and anticipate the future over an analogous internal timeline. This paper presents a mathematical framework for building this timeline of the future. We assume that the input to the system is a time series of symbols-sparse tokenized representations of the present-in continuous time. The goal is to record pairwise temporal relationships between symbols over a wide range of time scales. We assume that the brain has access to a temporal memory in the form of the real Laplace transform. Hebbian associations with a diversity of synaptic time scales are formed between the past timeline and the present symbol. The associative memory stores the convolution between the past and the present. Knowing the temporal relationship between the past and the present allows one to infer relationships between the present and the future. With appropriate normalization, this Hebbian associative matrix can store a Laplace successor representation and a Laplace predecessor representation from which measures of temporal contingency can be evaluated. The diversity of synaptic time constants allows for learning of non-stationary statistics as well as joint statistics between triplets of symbols. This framework synthesizes a number of recent neuroscientific findings including results from dopamine neurons in the mesolimbic forebrain.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9980275/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9113356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Probabilistic Genotype-Phenotype Maps Reveal Mutational Robustness of RNA Folding, Spin Glasses, and Quantum Circuits. 概率基因型表型图谱揭示了RNA折叠、自旋玻璃和量子电路的突变稳健性。
Pub Date : 2024-08-22
Anna Sappington, Vaibhav Mohanty

Recent studies of genotype-phenotype (GP) maps have reported universally enhanced phenotypic robustness to genotype mutations, a feature essential to evolution. Virtually all of these studies make a simplifying assumption that each genotype-represented as a sequence-maps deterministically to a single phenotype, such as a discrete structure. Here, we introduce probabilistic genotype-phenotype (PrGP) maps, where each genotype maps to a vector of phenotype probabilities, as a more realistic and universal language for investigating robustness in a variety of physical, biological, and computational systems. We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources: (1) thermal fluctuation in RNA folding, (2) external field disorder in spin glass ground state finding, and (3) superposition and entanglement in quantum circuits, which are realized experimentally on IBM quantum computers. In all three cases, we observe a novel biphasic robustness scaling which is enhanced relative to random expectation for more frequent phenotypes and approaches random expectation for less frequent phenotypes. We derive an analytical theory for the behavior of PrGP robustness, and we demonstrate that the theory is highly predictive of empirical robustness.

最近对基因型-表型(GP)图谱的研究报告称,表型对基因型突变的稳健性普遍增强,这是进化的一个重要特征。事实上,所有这些研究都做出了一个简化的假设,即每个基因型都决定性地映射到一个表型上。在这里,我们引入了概率基因型-表型(PrGP)图,其中每个基因型都映射到表型概率的载体,作为研究稳健性的更现实的框架。我们研究了三个模型系统,以表明我们的广义框架可以处理来自各种物理来源的不确定性:(1)RNA折叠中的热波动,(2)自旋玻璃基态发现中的外场无序,以及(3)量子电路中的叠加和纠缠,这些都是在7量子位IBM量子计算机上实验实现的。在所有三种情况下,我们都观察到一种新的双相鲁棒性标度,它相对于更频繁表型的随机预期有所增强,并接近不频繁表型的随意预期。
{"title":"Probabilistic Genotype-Phenotype Maps Reveal Mutational Robustness of RNA Folding, Spin Glasses, and Quantum Circuits.","authors":"Anna Sappington, Vaibhav Mohanty","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Recent studies of genotype-phenotype (GP) maps have reported universally enhanced phenotypic robustness to genotype mutations, a feature essential to evolution. Virtually all of these studies make a simplifying assumption that each genotype-represented as a sequence-maps deterministically to a single phenotype, such as a discrete structure. Here, we introduce probabilistic genotype-phenotype (PrGP) maps, where each genotype maps to a vector of phenotype probabilities, as a more realistic and universal language for investigating robustness in a variety of physical, biological, and computational systems. We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources: (1) thermal fluctuation in RNA folding, (2) external field disorder in spin glass ground state finding, and (3) superposition and entanglement in quantum circuits, which are realized experimentally on IBM quantum computers. In all three cases, we observe a novel biphasic robustness scaling which is enhanced relative to random expectation for more frequent phenotypes and approaches random expectation for less frequent phenotypes. We derive an analytical theory for the behavior of PrGP robustness, and we demonstrate that the theory is highly predictive of empirical robustness.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9882568/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10592904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability of energy landscape analysis of resting-state functional MRI data. 静息状态功能MRI数据能量景观分析的可靠性。
Pub Date : 2024-08-20
Pitambar Khanra, Johan Nakuci, Sarah Muldoon, Takamitsu Watanabe, Naoki Masuda

Energy landscape analysis is a data-driven method to analyze multidimensional time series, including functional magnetic resonance imaging (fMRI) data. It has been shown to be a useful characterization of fMRI data in health and disease. It fits an Ising model to the data and captures the dynamics of the data as movement of a noisy ball constrained on the energy landscape derived from the estimated Ising model. In the present study, we examine test-retest reliability of the energy landscape analysis. To this end, we construct a permutation test that assesses whether or not indices characterizing the energy landscape are more consistent across different sets of scanning sessions from the same participant (i.e., within-participant reliability) than across different sets of sessions from different participants (i.e., between-participant reliability). We show that the energy landscape analysis has significantly higher within-participant than between-participant test-retest reliability with respect to four commonly used indices. We also show that a variational Bayesian method, which enables us to estimate energy landscapes tailored to each participant, displays comparable test-retest reliability to that using the conventional likelihood maximization method. The proposed methodology paves the way to perform individual-level energy landscape analysis for given data sets with a statistically controlled reliability.

能量景观分析是一种数据驱动的方法,用于分析多维时间序列,包括功能磁共振成像(fMRI)数据。它已被证明是功能磁共振成像数据在健康和疾病方面的有用表征。它将伊辛模型拟合到数据中,并将数据的动态捕捉为受估计的伊辛模型导出的能量景观约束的有噪球的运动。在本研究中,我们检验了能源景观分析的重新测试可靠性。为此,我们构建了一个排列测试,评估表征能量景观的指标在来自同一参与者的不同扫描会话集之间(即,参与者内部可靠性)是否比在来自不同参与者的不同会话集之间更一致(即,参与者之间可靠性)。我们发现,就四个常用指数而言,能量景观分析在参与者内部的重测可靠性显著高于参与者之间的重测信度。我们还表明,变分贝叶斯方法使我们能够估计为每个参与者量身定制的能源景观,它显示出与传统似然最大化方法相当的测试重测可靠性。所提出的方法为以统计控制的可靠性对给定数据集进行个体水平的能量景观分析铺平了道路。
{"title":"Reliability of energy landscape analysis of resting-state functional MRI data.","authors":"Pitambar Khanra, Johan Nakuci, Sarah Muldoon, Takamitsu Watanabe, Naoki Masuda","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Energy landscape analysis is a data-driven method to analyze multidimensional time series, including functional magnetic resonance imaging (fMRI) data. It has been shown to be a useful characterization of fMRI data in health and disease. It fits an Ising model to the data and captures the dynamics of the data as movement of a noisy ball constrained on the energy landscape derived from the estimated Ising model. In the present study, we examine test-retest reliability of the energy landscape analysis. To this end, we construct a permutation test that assesses whether or not indices characterizing the energy landscape are more consistent across different sets of scanning sessions from the same participant (i.e., within-participant reliability) than across different sets of sessions from different participants (i.e., between-participant reliability). We show that the energy landscape analysis has significantly higher within-participant than between-participant test-retest reliability with respect to four commonly used indices. We also show that a variational Bayesian method, which enables us to estimate energy landscapes tailored to each participant, displays comparable test-retest reliability to that using the conventional likelihood maximization method. The proposed methodology paves the way to perform individual-level energy landscape analysis for given data sets with a statistically controlled reliability.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10312792/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10143764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Dynamic Sensorium competition for predicting large-scale mouse visual cortex activity from videos. 从视频中预测大规模小鼠视觉皮层活动的动态感官竞赛。
Pub Date : 2024-07-12
Polina Turishcheva, Paul G Fahey, Michaela Vystrčilová, Laura Hansel, Rachel Froebe, Kayla Ponder, Yongrong Qiu, Konstantin F Willeke, Mohammad Bashiri, Eric Wang, Zhiwei Ding, Andreas S Tolias, Fabian H Sinz, Alexander S Ecker

Understanding how biological visual systems process information is challenging due to the complex nonlinear relationship between neuronal responses and high-dimensional visual input. Artificial neural networks have already improved our understanding of this system by allowing computational neuroscientists to create predictive models and bridge biological and machine vision. During the Sensorium 2022 competition, we introduced benchmarks for vision models with static input (i.e. images). However, animals operate and excel in dynamic environments, making it crucial to study and understand how the brain functions under these conditions. Moreover, many biological theories, such as predictive coding, suggest that previous input is crucial for current input processing. Currently, there is no standardized benchmark to identify state-of-the-art dynamic models of the mouse visual system. To address this gap, we propose the Sensorium 2023 Benchmark Competition with dynamic input (https://www.sensorium-competition.net/). This competition includes the collection of a new large-scale dataset from the primary visual cortex of ten mice, containing responses from over 78,000 neurons to over 2 hours of dynamic stimuli per neuron. Participants in the main benchmark track will compete to identify the best predictive models of neuronal responses for dynamic input (i.e. video). We will also host a bonus track in which submission performance will be evaluated on out-of-domain input, using withheld neuronal responses to dynamic input stimuli whose statistics differ from the training set. Both tracks will offer behavioral data along with video stimuli. As before, we will provide code, tutorials, and strong pre-trained baseline models to encourage participation. We hope this competition will continue to strengthen the accompanying Sensorium benchmarks collection as a standard tool to measure progress in large-scale neural system identification models of the entire mouse visual hierarchy and beyond.

由于神经元反应和高维视觉输入之间的复杂非线性关系,理解生物视觉系统如何处理信息具有挑战性。人工神经网络已经通过允许计算神经科学家创建预测模型并桥接生物和机器视觉,提高了我们对该系统的理解。在Sensorium 2022比赛期间,我们引入了具有静态输入(即图像)的视觉模型基准。然而,动物在动态环境中运作并表现出色,因此研究和理解大脑在这些条件下的功能至关重要。此外,许多生物学理论,如预测编码,表明先前的输入对当前的输入处理至关重要。目前,还没有标准化的基准来识别鼠标视觉系统的最先进的动态模型。为了解决这一差距,我们提出了具有动态输入的Sensorium 2023基准竞赛(https://www.sensorium-competition.net/)。这项比赛包括从五只小鼠的初级视觉皮层收集一个新的大规模数据集,其中包含38000多个神经元对每个神经元超过2小时的动态刺激的反应。主要基准赛道的参与者将竞争确定用于动态输入(即视频)的神经元反应的最佳预测模型。我们还将主持一个奖励跟踪,在该跟踪中,将使用对统计数据与训练集不同的动态输入刺激的抑制神经元反应,对域外输入的提交性能进行评估。两首曲目都将提供行为数据和视频刺激。和以前一样,我们将提供代码、教程和强大的预训练基线模型,以鼓励参与。我们希望这场比赛将继续加强附带的Sensorium基准集合,作为衡量整个鼠标视觉层次及其他层次的大规模神经系统识别模型进展的标准工具。
{"title":"The Dynamic Sensorium competition for predicting large-scale mouse visual cortex activity from videos.","authors":"Polina Turishcheva, Paul G Fahey, Michaela Vystrčilová, Laura Hansel, Rachel Froebe, Kayla Ponder, Yongrong Qiu, Konstantin F Willeke, Mohammad Bashiri, Eric Wang, Zhiwei Ding, Andreas S Tolias, Fabian H Sinz, Alexander S Ecker","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Understanding how biological visual systems process information is challenging due to the complex nonlinear relationship between neuronal responses and high-dimensional visual input. Artificial neural networks have already improved our understanding of this system by allowing computational neuroscientists to create predictive models and bridge biological and machine vision. During the Sensorium 2022 competition, we introduced benchmarks for vision models with static input (i.e. images). However, animals operate and excel in dynamic environments, making it crucial to study and understand how the brain functions under these conditions. Moreover, many biological theories, such as predictive coding, suggest that previous input is crucial for current input processing. Currently, there is no standardized benchmark to identify state-of-the-art dynamic models of the mouse visual system. To address this gap, we propose the Sensorium 2023 Benchmark Competition with dynamic input (https://www.sensorium-competition.net/). This competition includes the collection of a new large-scale dataset from the primary visual cortex of ten mice, containing responses from over 78,000 neurons to over 2 hours of dynamic stimuli per neuron. Participants in the main benchmark track will compete to identify the best predictive models of neuronal responses for dynamic input (i.e. video). We will also host a bonus track in which submission performance will be evaluated on out-of-domain input, using withheld neuronal responses to dynamic input stimuli whose statistics differ from the training set. Both tracks will offer behavioral data along with video stimuli. As before, we will provide code, tutorials, and strong pre-trained baseline models to encourage participation. We hope this competition will continue to strengthen the accompanying Sensorium benchmarks collection as a standard tool to measure progress in large-scale neural system identification models of the entire mouse visual hierarchy and beyond.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ftp.ncbi.nlm.nih.gov/pub/pmc/oa_pdf/22/e8/nihpp-2305.19654v1.PMC10312815.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9814779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A dual benchmarking study of facial forgery and facial forensics 面部伪造和面部取证的双重基准研究
Pub Date : 2024-07-05 DOI: 10.1049/cit2.12362
Minh Tam Pham, T. T. Huynh, Vinh Tong, T. Nguyen, T. Nguyen, Hongzhi Yin, Q. Nguyen
In recent years, visual facial forgery has reached a level of sophistication that humans cannot identify fraud, which poses a significant threat to information security. A wide range of malicious applications have emerged, such as deepfake, fake news, defamation or blackmailing of celebrities, impersonation of politicians in political warfare, and the spreading of rumours to attract views. As a result, a rich body of visual forensic techniques has been proposed in an attempt to stop this dangerous trend. However, there is no comprehensive, fair, and unified performance evaluation to enlighten the community on best performing methods. The authors present a systematic benchmark beyond traditional surveys that provides in‐depth insights into facial forgery and facial forensics, grounding on robustness tests such as contrast, brightness, noise, resolution, missing information, and compression. The authors also provide a practical guideline of the benchmarking results, to determine the characteristics of the methods that serve as a comparative reference in this never‐ending war between measures and countermeasures. The authors’ source code is open to the public.
近年来,视觉面部伪造已经达到了人类无法识别欺诈的复杂程度,这对信息安全构成了重大威胁。各种恶意应用层出不穷,如深度伪造、假新闻、诽谤或勒索名人、在政治战争中假冒政客,以及散布谣言以吸引眼球。因此,人们提出了大量视觉取证技术,试图阻止这一危险趋势。然而,目前还没有一个全面、公平、统一的性能评估来帮助人们了解性能最佳的方法。作者提出了一个超越传统调查的系统性基准,以对比度、亮度、噪声、分辨率、缺失信息和压缩等鲁棒性测试为基础,深入剖析了面部伪造和面部取证问题。作者还提供了基准测试结果的实用指南,以确定各种方法的特点,在这场永无休止的措施与对策之战中作为比较参考。作者的源代码对公众开放。
{"title":"A dual benchmarking study of facial forgery and facial forensics","authors":"Minh Tam Pham, T. T. Huynh, Vinh Tong, T. Nguyen, T. Nguyen, Hongzhi Yin, Q. Nguyen","doi":"10.1049/cit2.12362","DOIUrl":"https://doi.org/10.1049/cit2.12362","url":null,"abstract":"In recent years, visual facial forgery has reached a level of sophistication that humans cannot identify fraud, which poses a significant threat to information security. A wide range of malicious applications have emerged, such as deepfake, fake news, defamation or blackmailing of celebrities, impersonation of politicians in political warfare, and the spreading of rumours to attract views. As a result, a rich body of visual forensic techniques has been proposed in an attempt to stop this dangerous trend. However, there is no comprehensive, fair, and unified performance evaluation to enlighten the community on best performing methods. The authors present a systematic benchmark beyond traditional surveys that provides in‐depth insights into facial forgery and facial forensics, grounding on robustness tests such as contrast, brightness, noise, resolution, missing information, and compression. The authors also provide a practical guideline of the benchmarking results, to determine the characteristics of the methods that serve as a comparative reference in this never‐ending war between measures and countermeasures. The authors’ source code is open to the public.","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141674328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments. LinearAlifold:RNA 对齐的线性时间共识结构预测
Pub Date : 2024-07-05
Apoorv Malik, Liang Zhang, Milan Gautam, Ning Dai, Sizhen Li, He Zhang, David H Mathews, Liang Huang

Predicting the consensus structure of a set of aligned RNA homologs is a convenient method to find conserved structures in an RNA genome, which has many applications including viral diagnostics and therapeutics. However, the most commonly used tool for this task, RNAalifold, is prohibitively slow for long sequences, due to a cubic scaling with the sequence length, taking over a day on 400 SARS-CoV-2 and SARS-related genomes (~30,000nt). We present LinearAlifold, a much faster alternative that scales linearly with both the sequence length and the number of sequences, based on our work LinearFold that folds a single RNA in linear time. Our work is orders of magnitude faster than RNAalifold (0.7 hours on the above 400 genomes, or ~36$times$ speedup) and achieves higher accuracies when compared to a database of known structures. More interestingly, LinearAlifold's prediction on SARS-CoV-2 correlates well with experimentally determined structures, substantially outperforming RNAalifold. Finally, LinearAlifold supports two energy models (Vienna and BL*) and four modes: minimum free energy (MFE), maximum expected accuracy (MEA), ThreshKnot, and stochastic sampling, each of which takes under an hour for hundreds of SARS-CoV variants. Our resource is at: https://github.com/LinearFold/LinearAlifold (code) and http://linearfold.org/linear-alifold (server).

预测一组对齐的 RNA 同源物的共识结构是发现 RNA 基因组中保守结构的一种便捷方法,它在病毒诊断和治疗等方面有很多应用。然而,最常用的工具 RNAalifold 在处理长序列时速度太慢,因为序列长度呈立方缩放,处理 400 个 SARS-CoV-2 和 SARS 相关基因组(约 30,000nt )需要一天多的时间。我们提出的 LinearAlifold 是一种更快的替代方法,它与序列长度和序列数量成线性比例,基于我们在线性时间内折叠单个 RNA 的工作 LinearFold。我们的工作比 RNAalifold 快了几个数量级(在上述 400 个基因组上只用了 0.7 个小时,即加快了约 36 倍),而且与已知结构数据库相比,达到了更高的精确度。更有趣的是,LinearAlifold 对 SARS-CoV-2 的预测与实验确定的结构有很好的相关性,大大超过了 RNAalifold。最后,LinearAlifold 支持两种能量模型(Vienna 和 BL*)和四种模式:最小自由能 (MFE)、最大预期准确度 (MEA)、ThreshKnot 和随机抽样,其中每种模式对数百种 SARS-CoV 变体的预测时间都不超过一小时。我们的资源位于:https://github.com/LinearFold/LinearAlifold(代码)和 http://linearfold.org/linear-alifold(服务器)。
{"title":"LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments.","authors":"Apoorv Malik, Liang Zhang, Milan Gautam, Ning Dai, Sizhen Li, He Zhang, David H Mathews, Liang Huang","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Predicting the consensus structure of a set of aligned RNA homologs is a convenient method to find conserved structures in an RNA genome, which has many applications including viral diagnostics and therapeutics. However, the most commonly used tool for this task, RNAalifold, is prohibitively slow for long sequences, due to a cubic scaling with the sequence length, taking over a day on 400 SARS-CoV-2 and SARS-related genomes (~30,000nt). We present LinearAlifold, a much faster alternative that scales linearly with both the sequence length and the number of sequences, based on our work LinearFold that folds a single RNA in linear time. Our work is orders of magnitude faster than RNAalifold (0.7 hours on the above 400 genomes, or ~36$times$ speedup) and achieves higher accuracies when compared to a database of known structures. More interestingly, LinearAlifold's prediction on SARS-CoV-2 correlates well with experimentally determined structures, substantially outperforming RNAalifold. Finally, LinearAlifold supports two energy models (Vienna and BL*) and four modes: minimum free energy (MFE), maximum expected accuracy (MEA), ThreshKnot, and stochastic sampling, each of which takes under an hour for hundreds of SARS-CoV variants. Our resource is at: https://github.com/LinearFold/LinearAlifold (code) and http://linearfold.org/linear-alifold (server).</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9258297/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40566128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Gene Set Summarization Using Large Language Models. 使用大型语言模型的基因集摘要。
Pub Date : 2024-07-04
Marcin P Joachimiak, J Harry Caufield, Nomi L Harris, Hyeongsik Kim, Christopher J Mungall

Molecular biologists frequently interpret gene lists derived from high-throughput experiments and computational analysis. This is typically done as a statistical enrichment analysis that measures the over- or under-representation of biological function terms associated with genes or their properties, based on curated assertions from a knowledge base (KB) such as the Gene Ontology (GO). Interpreting gene lists can also be framed as a textual summarization task, enabling Large Language Models (LLMs) to use scientific texts directly and avoid reliance on a KB. TALISMAN (Terminological ArtificiaL Intelligence SuMmarization of Annotation and Narratives) uses generative AI to perform gene set function summarization as a complement to standard enrichment analysis. This method can use different sources of gene functional information: (1) structured text derived from curated ontological KB annotations, (2) ontology-free narrative gene summaries, or (3) direct retrieval from the model. We demonstrate that these methods are able to generate plausible and biologically valid summary GO term lists for an input gene set. However, LLM-based approaches are unable to deliver reliable scores or p-values and often return terms that are not statistically significant. Crucially, in our experiments these methods were rarely able to recapitulate the most precise and informative term from standard enrichment analysis. We also observe minor differences depending on prompt input information, with GO term descriptions leading to higher recall but lower precision. However, newer LLM models perform statistically significantly better than the oldest model across all performance metrics, suggesting that future models may lead to further improvements. Overall, the results are nondeterministic, with minor variations in prompt resulting in radically different term lists, true to the stochastic nature of LLMs. Our results show that at this point, LLM-based methods are unsuitable as a replacement for standard term enrichment analysis, however they may provide summarization benefits for implicit knowledge integration across extant but unstandardized knowledge, for large sets of features, and where the amount of information is difficult for humans to process.

分子生物学家经常解读来自高通量实验和计算分析的基因列表。这通常是作为一种统计富集分析来完成的,该分析基于来自知识库(KB)(如基因本体论(GO))的精心策划的断言,测量与基因或其特性相关的生物功能术语的过度或不足表示。解释基因列表也可以被定义为一项文本摘要任务,从而能够使用大型语言模型(LLM),有可能直接利用科学文本,避免对知识库的依赖。我们开发了SPINDOCTOR(用于本体报告的受控术语的自然语言描述的结构化提示插值),这是一种使用GPT模型执行基因集功能摘要的方法,作为标准富集分析的补充。该方法可以使用不同的基因功能信息来源:(1)从精心策划的本体论知识库注释中导出的结构化文本,(2)无本体论的叙述性基因摘要,或(3)直接模型检索。我们证明,这些方法能够为基因集生成合理且生物学有效的GO术语汇总表。然而,基于GPT的方法无法提供可靠的分数或p值,并且经常返回不具有统计意义的术语。至关重要的是,这些方法很少能够从标准丰富中概括出最精确、信息最丰富的术语,这可能是由于无法使用本体进行概括和推理。结果是高度不确定性的,提示中的微小变化导致了完全不同的术语列表。我们的结果表明,在这一点上,基于LLM的方法不适合作为标准术语丰富分析的替代品,本体论断言的手动管理仍然是必要的。
{"title":"Gene Set Summarization Using Large Language Models.","authors":"Marcin P Joachimiak, J Harry Caufield, Nomi L Harris, Hyeongsik Kim, Christopher J Mungall","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Molecular biologists frequently interpret gene lists derived from high-throughput experiments and computational analysis. This is typically done as a statistical enrichment analysis that measures the over- or under-representation of biological function terms associated with genes or their properties, based on curated assertions from a knowledge base (KB) such as the Gene Ontology (GO). Interpreting gene lists can also be framed as a textual summarization task, enabling Large Language Models (LLMs) to use scientific texts directly and avoid reliance on a KB. TALISMAN (Terminological ArtificiaL Intelligence SuMmarization of Annotation and Narratives) uses generative AI to perform gene set function summarization as a complement to standard enrichment analysis. This method can use different sources of gene functional information: (1) structured text derived from curated ontological KB annotations, (2) ontology-free narrative gene summaries, or (3) direct retrieval from the model. We demonstrate that these methods are able to generate plausible and biologically valid summary GO term lists for an input gene set. However, LLM-based approaches are unable to deliver reliable scores or p-values and often return terms that are not statistically significant. Crucially, in our experiments these methods were rarely able to recapitulate the most precise and informative term from standard enrichment analysis. We also observe minor differences depending on prompt input information, with GO term descriptions leading to higher recall but lower precision. However, newer LLM models perform statistically significantly better than the oldest model across all performance metrics, suggesting that future models may lead to further improvements. Overall, the results are nondeterministic, with minor variations in prompt resulting in radically different term lists, true to the stochastic nature of LLMs. Our results show that at this point, LLM-based methods are unsuitable as a replacement for standard term enrichment analysis, however they may provide summarization benefits for implicit knowledge integration across extant but unstandardized knowledge, for large sets of features, and where the amount of information is difficult for humans to process.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246080/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9622249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Joint regional uptake quantification of Thorium-227 and Radium-223 using a multiple-energy-window projection-domain quantitative SPECT method. 使用多能量窗投影域定量 SPECT 方法联合量化钍-227 和镭-223 的区域摄取量。
Pub Date : 2024-07-01
Zekun Li, Nadia Benabdallah, Richard Laforest, Richard L Wahl, Daniel L J Thorek, Abhinav K Jha

Thorium-227-based alpha-particle radiopharmaceutical therapies ({alpha}-RPTs) are being investigated in several clinical and pre-clinical studies. After administration, Thorium-227 decays to Radium-223, another alpha-particle-emitting isotope, which redistributes within the patient. Reliable dose quantification of both Thorium-227 and Radium-223 is clinically important, and SPECT may perform this quantification as these isotopes also emit X- and gamma-ray photons. However, reliable quantification is challenged by the orders-of-magnitude lower activity compared to conventional SPECT, resulting in a very low number of detected counts, the presence of multiple photopeaks, substantial overlap in the emission spectra of these isotopes, and the image-degrading effects in SPECT. To address these issues, we propose a multiple-energy-window projection-domain quantification (MEW-PDQ) method that jointly estimates the regional activity uptake of both Thorium-227 and Radium-223 directly using the SPECT projection from multiple energy windows. We evaluated the method with realistic simulation studies using anthropomorphic digital phantoms, in the context of imaging patients with bone metastases of prostate cancer and treated with Thorium-227-based {alpha}-RPTs. The proposed method yielded reliable (accurate and precise) regional uptake estimates of both isotopes and outperformed state-of-the-art methods across different lesion sizes and contrasts, in a virtual imaging trial, as well as with moderate levels of intra-regional heterogeneous uptake and with moderate inaccuracies in the definitions of the support of various regions. Additionally, we demonstrated the effectiveness of using multiple energy windows and the variance of the estimated uptake using the proposed method approached the Cram'er-Rao-lower-bound-defined theoretical limit.

一些临床和临床前研究正在对基于钍-227的α粒子放射性药物疗法({alpha}-RPTs)进行研究。给药后,钍-227 会衰变为镭-223(另一种发射阿尔法粒子的同位素),并在患者体内重新分布。钍-227 和镭-223 的可靠剂量定量在临床上非常重要,SPECT 可以进行这种定量,因为这些同位素也发射 X 射线和伽马射线光子。然而,与传统的 SPECT 相比,这些同位素的放射性活度低了几个数量级,导致检测到的计数数量非常低、存在多个光峰、发射光谱大量重叠以及 SPECT 中的图像衰减效应,这些都给可靠的定量带来了挑战。为了解决这些问题,我们提出了一种多能量窗投影域量化(MEW-PDQ)方法,该方法直接利用多个能量窗的 SPECT 投影来联合估算钍-227 和镭-223 的区域活性吸收。我们利用拟人数字模型进行了真实的模拟研究,在对前列腺癌骨转移患者进行钍-227基{alpha}-RPTs成像时对该方法进行了评估。在虚拟成像试验中,在不同病灶大小和对比度的情况下,以及在中度区域内异质摄取和中度区域支持定义不准确的情况下,所提出的方法对两种同位素的区域摄取量都做出了可靠(准确和精确)的估计,并优于最先进的方法。此外,我们还证明了使用多个能量窗口的有效性,而且使用所提方法估计的摄取量方差接近 Cram'er-Rao-lower-bound 定义的理论极限。
{"title":"Joint regional uptake quantification of Thorium-227 and Radium-223 using a multiple-energy-window projection-domain quantitative SPECT method.","authors":"Zekun Li, Nadia Benabdallah, Richard Laforest, Richard L Wahl, Daniel L J Thorek, Abhinav K Jha","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Thorium-227-based alpha-particle radiopharmaceutical therapies ({alpha}-RPTs) are being investigated in several clinical and pre-clinical studies. After administration, Thorium-227 decays to Radium-223, another alpha-particle-emitting isotope, which redistributes within the patient. Reliable dose quantification of both Thorium-227 and Radium-223 is clinically important, and SPECT may perform this quantification as these isotopes also emit X- and gamma-ray photons. However, reliable quantification is challenged by the orders-of-magnitude lower activity compared to conventional SPECT, resulting in a very low number of detected counts, the presence of multiple photopeaks, substantial overlap in the emission spectra of these isotopes, and the image-degrading effects in SPECT. To address these issues, we propose a multiple-energy-window projection-domain quantification (MEW-PDQ) method that jointly estimates the regional activity uptake of both Thorium-227 and Radium-223 directly using the SPECT projection from multiple energy windows. We evaluated the method with realistic simulation studies using anthropomorphic digital phantoms, in the context of imaging patients with bone metastases of prostate cancer and treated with Thorium-227-based {alpha}-RPTs. The proposed method yielded reliable (accurate and precise) regional uptake estimates of both isotopes and outperformed state-of-the-art methods across different lesion sizes and contrasts, in a virtual imaging trial, as well as with moderate levels of intra-regional heterogeneous uptake and with moderate inaccuracies in the definitions of the support of various regions. Additionally, we demonstrated the effectiveness of using multiple energy windows and the variance of the estimated uptake using the proposed method approached the Cram'er-Rao-lower-bound-defined theoretical limit.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246079/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9608651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Gene activity fully predicts transcriptional bursting dynamics. 常见的爆发关系是真核生物转录动力学的基础。
Pub Date : 2024-06-28
Po-Ta Chen, Michal Levo, Benjamin Zoller, Thomas Gregor

Transcription commonly occurs in bursts, with alternating productive (ON) and quiescent (OFF) periods, governing mRNA production rates. Yet, how transcription is regulated through bursting dynamics remains unresolved. Here, we conduct real-time measurements of endogenous transcriptional bursting with single-mRNA sensitivity. Leveraging the diverse transcriptional activities in early fly embryos, we uncover stringent relationships between bursting parameters. Specifically, we find that the durations of ON and OFF periods are linked. Regardless of the developmental stage or body-axis position, gene activity levels predict individual alleles' average ON and OFF periods. Lowly transcribing alleles predominantly modulate OFF periods (burst frequency), while highly transcribing alleles primarily tune ON periods (burst size). These relationships persist even under perturbations of cis-regulatory elements or trans-factors and account for bursting dynamics measured in other species. Our results suggest a novel mechanistic constraint governing bursting dynamics rather than a modular control of distinct parameters by distinct regulatory processes.

转录通常发生在由交替的生产期(ON)和静止期(OFF)引起的爆发中。然而,如何调节转录爆发来确定时空转录活性仍不清楚。在这里,我们对苍蝇胚胎中的关键发育基因进行了实时转录成像,具有单一聚合酶敏感性。单等位基因转录率和多聚合酶爆发的量化揭示了所有基因之间在时间和空间上的共同爆发关系,以及顺式和反式扰动。我们确定等位基因的ON概率是转录速率的主要决定因素,而转录起始速率的变化是有限的。任何给定的开启概率都决定了平均开启和关闭时间的特定组合,从而保持恒定的特征爆破时间尺度。我们的研究结果表明,主要影响开启概率的各种调节过程的趋同,从而控制mRNA的产生,而不是开启和关闭时间的机制特异性调节。因此,我们的研究结果激励并指导了对实现这些爆发规则和调控转录调控机制的新研究。
{"title":"Gene activity fully predicts transcriptional bursting dynamics.","authors":"Po-Ta Chen, Michal Levo, Benjamin Zoller, Thomas Gregor","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Transcription commonly occurs in bursts, with alternating productive (ON) and quiescent (OFF) periods, governing mRNA production rates. Yet, how transcription is regulated through bursting dynamics remains unresolved. Here, we conduct real-time measurements of endogenous transcriptional bursting with single-mRNA sensitivity. Leveraging the diverse transcriptional activities in early fly embryos, we uncover stringent relationships between bursting parameters. Specifically, we find that the durations of ON and OFF periods are linked. Regardless of the developmental stage or body-axis position, gene activity levels predict individual alleles' average ON and OFF periods. Lowly transcribing alleles predominantly modulate OFF periods (burst frequency), while highly transcribing alleles primarily tune ON periods (burst size). These relationships persist even under perturbations of cis-regulatory elements or trans-factors and account for bursting dynamics measured in other species. Our results suggest a novel mechanistic constraint governing bursting dynamics rather than a modular control of distinct parameters by distinct regulatory processes.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10153294/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9807592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Brain Tumor Segmentation - Metastases (BraTS-METS) Challenge 2023: Brain Metastasis Segmentation on Pre-treatment MRI. 脑肿瘤分割(BraTS METS)挑战2023:治疗前MRI上的脑转移分割。
Pub Date : 2024-06-17
Ahmed W Moawad, Anastasia Janas, Ujjwal Baid, Divya Ramakrishnan, Rachit Saluja, Nader Ashraf, Leon Jekel, Raisa Amiruddin, Maruf Adewole, Jake Albrecht, Udunna Anazodo, Sanjay Aneja, Syed Muhammad Anwar, Timothy Bergquist, Evan Calabrese, Veronica Chiang, Verena Chung, Gian Marco Marco Conte, Farouk Dako, James Eddy, Ivan Ezhov, Ariana Familiar, Keyvan Farahani, Juan Eugenio Iglesias, Zhifan Jiang, Elaine Johanson, Anahita Fathi Kazerooni, Florian Kofler, Kiril Krantchev, Dominic LaBella, Koen Van Leemput, Hongwei Bran Li, Marius George Linguraru, Katherine E Link, Xinyang Liu, Nazanin Maleki, Zeke Meier, Bjoern H Menze, Harrison Moy, Klara Osenberg, Marie Piraud, Zachary Reitman, Russel Takeshi Shinohara, Nourel Hoda Tahon, Ayman Nada, Yuri S Velichko, Chunhao Wang, Benedikt Wiestler, Walter Wiggins, Umber Shafique, Klara Willms, Arman Avesta, Khaled Bousabarah, Satrajit Chakrabarty, Nicolo Gennaro, Wolfgang Holler, Manpreet Kaur, Pamela LaMontagne, MingDe Lin, Jan Lost, Daniel S Marcus, Ryan Maresca, Sarah Merkaj, Ayaman Nada, Gabriel Cassinelli Pedersen, Marc von Reppert, Aristeidis Sotiras, Oleg Teytelboym, Niklas Tillmans, Malte Westerhoff, Ayda Youssef, Devon Godfrey, Scott Floyd, Andreas Rauschecker, Javier Villanueva-Meyer, Irada Pflüger, Jaeyoung Cho, Martin Bendszus, Gianluca Brugnara, Justin Cramer, Gloria J Guzman Perez-Carillo, Derek R Johnson, Anthony Kam, Benjamin Yin Ming Kwan, Lillian Lai, Neil U Lall, Fatima Memon, Satya Narayana Patro, Bojan Petrovic, Tiffany Y So, Gerard Thompson, Lei Wu, E Brooke Schrickel, Anu Bansal, Frederik Barkhof, Cristina Besada, Sammy Chu, Jason Druzgal, Alexandru Dusoi, Luciano Farage, Fabricio Feltrin, Amy Fong, Steve H Fung, R Ian Gray, Ichiro Ikuta, Michael Iv, Alida A Postma, Amit Mahajan, David Joyner, Chase Krumpelman, Laurent Letourneau-Guillon, Christie M Lincoln, Mate E Maros, Elka Miller, Fanny Morón, Esther A Nimchinsky, Ozkan Ozsarlak, Uresh Patel, Saurabh Rohatgi, Atin Saha, Anousheh Sayah, Eric D Schwartz, Robert Shih, Mark S Shiroishi, Juan E Small, Manoj Tanwar, Jewels Valerie, Brent D Weinberg, Matthew L White, Robert Young, Vahe M Zohrabian, Aynur Azizova, Melanie Maria Theresa Brüßeler, Pascal Fehringer, Mohanad Ghonim, Mohamed Ghonim, Athanasios Gkampenis, Abdullah Okar, Luca Pasquini, Yasaman Sharifi, Gagandeep Singh, Nico Sollmann, Theodora Soumala, Mahsa Taherzadeh, Nikolay Yordanov, Philipp Vollmuth, Martha Foltyn-Dumitru, Ajay Malhotra, Aly H Abayazeed, Francesco Dellepiane, Philipp Lohmann, Víctor M Pérez-García, Hesham Elhalawani, Sanaria Al-Rubaiey, Rui Duarte Armindo, Kholod Ashraf, Moamen M Asla, Mohamed Badawy, Jeroen Bisschop, Nima Broomand Lomer, Jan Bukatz, Jim Chen, Petra Cimflova, Felix Corr, Alexis Crawley, Lisa Deptula, Tasneem Elakhdar, Islam H Shawali, Shahriar Faghani, Alexandra Frick, Vaibhav Gulati, Muhammad Ammar Haider, Fátima Hierro, Rasmus Holmboe Dahl, Sarah Maria Jacobs, Kuang-Chun Jim Hsieh, Sedat G Kandemirli, Katharina Kersting, Laura Kida, Sofia Kollia, Ioannis Koukoulithras, Xiao Li, Ahmed Abouelatta, Aya Mansour, Ruxandra-Catrinel Maria-Zamfirescu, Marcela Marsiglia, Yohana Sarahi Mateo-Camacho, Mark McArthur, Olivia McDonnell, Maire McHugh, Mana Moassefi, Samah Mostafa Morsi, Alexander Muntenu, Khanak K Nandolia, Syed Raza Naqvi, Yalda Nikanpour, Mostafa Alnoury, Abdullah Mohamed Aly Nouh, Francesca Pappafava, Markand D Patel, Samantha Petrucci, Eric Rawie, Scott Raymond, Borna Roohani, Sadeq Sabouhi, Laura M Sanchez-Garcia, Zoe Shaked, Pokhraj P Suthar, Talissa Altes, Edvin Isufi, Yaseen Dhermesh, Jaime Gass, Jonathan Thacker, Abdul Rahman Tarabishy, Benjamin Turner, Sebastiano Vacca, George K Vilanilam, Daniel Warren, David Weiss, Klara Willms, Fikadu Worede, Sara Yousry, Wondwossen Lerebo, Alejandro Aristizabal, Alexandros Karargyris, Hasan Kassem, Sarthak Pati, Micah Sheller, Spyridon Bakas, Jeffrey D Rudie, Mariam Aboian

The translation of AI-generated brain metastases (BM) segmentation into clinical practice relies heavily on diverse, high-quality annotated medical imaging datasets. The BraTS-METS 2023 challenge has gained momentum for testing and benchmarking algorithms using rigorously annotated internationally compiled real-world datasets. This study presents the results of the segmentation challenge and characterizes the challenging cases that impacted the performance of the winning algorithms. Untreated brain metastases on standard anatomic MRI sequences (T1, T2, FLAIR, T1PG) from eight contributed international datasets were annotated in stepwise method: published UNET algorithms, student, neuroradiologist, final approver neuroradiologist. Segmentations were ranked based on lesion-wise Dice and Hausdorff distance (HD95) scores. False positives (FP) and false negatives (FN) were rigorously penalized, receiving a score of 0 for Dice and a fixed penalty of 374 for HD95. The mean scores for the teams were calculated. Eight datasets comprising 1303 studies were annotated, with 402 studies (3076 lesions) released on Synapse as publicly available datasets to challenge competitors. Additionally, 31 studies (139 lesions) were held out for validation, and 59 studies (218 lesions) were used for testing. Segmentation accuracy was measured as rank across subjects, with the winning team achieving a LesionWise mean score of 7.9. The Dice score for the winning team was 0.65 ± 0.25. Common errors among the leading teams included false negatives for small lesions and misregistration of masks in space. The Dice scores and lesion detection rates of all algorithms diminished with decreasing tumor size, particularly for tumors smaller than 100 mm3. In conclusion, algorithms for BM segmentation require further refinement to balance high sensitivity in lesion detection with the minimization of false positives and negatives. The BraTS-METS 2023 challenge successfully curated well-annotated, diverse datasets and identified common errors, facilitating the translation of BM segmentation across varied clinical environments and providing personalized volumetric reports to patients undergoing BM treatment.

对转移到大脑的疾病进行临床监测可能是一个费力且耗时的过程,尤其是在涉及多个转移的情况下,当手动进行评估时。神经肿瘤脑转移反应评估(RANO-BM)指南利用一维最长直径,通常用于临床和研究环境,以评估脑转移患者的治疗反应。然而,对病变和周围病变水肿进行准确的体积评估在临床决策中具有重要意义,可以大大提高结果预测。对脑转移瘤进行分割的独特挑战在于它们作为小病变的常见情况。在先前的出版物中,对尺寸小于10mm的病变的检测和分割没有显示出高准确性。由于病变大小的显著可变性,脑转移挑战与之前在神经胶质瘤分割上进行的MICCAI挑战不同。与胶质瘤不同,胶质瘤在表现扫描时往往更大,脑转移瘤的大小范围很广,往往包括小的病变。我们希望BraTS-METS数据集和挑战将推动自动脑转移检测和分割领域的发展。
{"title":"The Brain Tumor Segmentation - Metastases (BraTS-METS) Challenge 2023: Brain Metastasis Segmentation on Pre-treatment MRI.","authors":"Ahmed W Moawad, Anastasia Janas, Ujjwal Baid, Divya Ramakrishnan, Rachit Saluja, Nader Ashraf, Leon Jekel, Raisa Amiruddin, Maruf Adewole, Jake Albrecht, Udunna Anazodo, Sanjay Aneja, Syed Muhammad Anwar, Timothy Bergquist, Evan Calabrese, Veronica Chiang, Verena Chung, Gian Marco Marco Conte, Farouk Dako, James Eddy, Ivan Ezhov, Ariana Familiar, Keyvan Farahani, Juan Eugenio Iglesias, Zhifan Jiang, Elaine Johanson, Anahita Fathi Kazerooni, Florian Kofler, Kiril Krantchev, Dominic LaBella, Koen Van Leemput, Hongwei Bran Li, Marius George Linguraru, Katherine E Link, Xinyang Liu, Nazanin Maleki, Zeke Meier, Bjoern H Menze, Harrison Moy, Klara Osenberg, Marie Piraud, Zachary Reitman, Russel Takeshi Shinohara, Nourel Hoda Tahon, Ayman Nada, Yuri S Velichko, Chunhao Wang, Benedikt Wiestler, Walter Wiggins, Umber Shafique, Klara Willms, Arman Avesta, Khaled Bousabarah, Satrajit Chakrabarty, Nicolo Gennaro, Wolfgang Holler, Manpreet Kaur, Pamela LaMontagne, MingDe Lin, Jan Lost, Daniel S Marcus, Ryan Maresca, Sarah Merkaj, Ayaman Nada, Gabriel Cassinelli Pedersen, Marc von Reppert, Aristeidis Sotiras, Oleg Teytelboym, Niklas Tillmans, Malte Westerhoff, Ayda Youssef, Devon Godfrey, Scott Floyd, Andreas Rauschecker, Javier Villanueva-Meyer, Irada Pflüger, Jaeyoung Cho, Martin Bendszus, Gianluca Brugnara, Justin Cramer, Gloria J Guzman Perez-Carillo, Derek R Johnson, Anthony Kam, Benjamin Yin Ming Kwan, Lillian Lai, Neil U Lall, Fatima Memon, Satya Narayana Patro, Bojan Petrovic, Tiffany Y So, Gerard Thompson, Lei Wu, E Brooke Schrickel, Anu Bansal, Frederik Barkhof, Cristina Besada, Sammy Chu, Jason Druzgal, Alexandru Dusoi, Luciano Farage, Fabricio Feltrin, Amy Fong, Steve H Fung, R Ian Gray, Ichiro Ikuta, Michael Iv, Alida A Postma, Amit Mahajan, David Joyner, Chase Krumpelman, Laurent Letourneau-Guillon, Christie M Lincoln, Mate E Maros, Elka Miller, Fanny Morón, Esther A Nimchinsky, Ozkan Ozsarlak, Uresh Patel, Saurabh Rohatgi, Atin Saha, Anousheh Sayah, Eric D Schwartz, Robert Shih, Mark S Shiroishi, Juan E Small, Manoj Tanwar, Jewels Valerie, Brent D Weinberg, Matthew L White, Robert Young, Vahe M Zohrabian, Aynur Azizova, Melanie Maria Theresa Brüßeler, Pascal Fehringer, Mohanad Ghonim, Mohamed Ghonim, Athanasios Gkampenis, Abdullah Okar, Luca Pasquini, Yasaman Sharifi, Gagandeep Singh, Nico Sollmann, Theodora Soumala, Mahsa Taherzadeh, Nikolay Yordanov, Philipp Vollmuth, Martha Foltyn-Dumitru, Ajay Malhotra, Aly H Abayazeed, Francesco Dellepiane, Philipp Lohmann, Víctor M Pérez-García, Hesham Elhalawani, Sanaria Al-Rubaiey, Rui Duarte Armindo, Kholod Ashraf, Moamen M Asla, Mohamed Badawy, Jeroen Bisschop, Nima Broomand Lomer, Jan Bukatz, Jim Chen, Petra Cimflova, Felix Corr, Alexis Crawley, Lisa Deptula, Tasneem Elakhdar, Islam H Shawali, Shahriar Faghani, Alexandra Frick, Vaibhav Gulati, Muhammad Ammar Haider, Fátima Hierro, Rasmus Holmboe Dahl, Sarah Maria Jacobs, Kuang-Chun Jim Hsieh, Sedat G Kandemirli, Katharina Kersting, Laura Kida, Sofia Kollia, Ioannis Koukoulithras, Xiao Li, Ahmed Abouelatta, Aya Mansour, Ruxandra-Catrinel Maria-Zamfirescu, Marcela Marsiglia, Yohana Sarahi Mateo-Camacho, Mark McArthur, Olivia McDonnell, Maire McHugh, Mana Moassefi, Samah Mostafa Morsi, Alexander Muntenu, Khanak K Nandolia, Syed Raza Naqvi, Yalda Nikanpour, Mostafa Alnoury, Abdullah Mohamed Aly Nouh, Francesca Pappafava, Markand D Patel, Samantha Petrucci, Eric Rawie, Scott Raymond, Borna Roohani, Sadeq Sabouhi, Laura M Sanchez-Garcia, Zoe Shaked, Pokhraj P Suthar, Talissa Altes, Edvin Isufi, Yaseen Dhermesh, Jaime Gass, Jonathan Thacker, Abdul Rahman Tarabishy, Benjamin Turner, Sebastiano Vacca, George K Vilanilam, Daniel Warren, David Weiss, Klara Willms, Fikadu Worede, Sara Yousry, Wondwossen Lerebo, Alejandro Aristizabal, Alexandros Karargyris, Hasan Kassem, Sarthak Pati, Micah Sheller, Spyridon Bakas, Jeffrey D Rudie, Mariam Aboian","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>The translation of AI-generated brain metastases (BM) segmentation into clinical practice relies heavily on diverse, high-quality annotated medical imaging datasets. The BraTS-METS 2023 challenge has gained momentum for testing and benchmarking algorithms using rigorously annotated internationally compiled real-world datasets. This study presents the results of the segmentation challenge and characterizes the challenging cases that impacted the performance of the winning algorithms. Untreated brain metastases on standard anatomic MRI sequences (T1, T2, FLAIR, T1PG) from eight contributed international datasets were annotated in stepwise method: published UNET algorithms, student, neuroradiologist, final approver neuroradiologist. Segmentations were ranked based on lesion-wise Dice and Hausdorff distance (HD95) scores. False positives (FP) and false negatives (FN) were rigorously penalized, receiving a score of 0 for Dice and a fixed penalty of 374 for HD95. The mean scores for the teams were calculated. Eight datasets comprising 1303 studies were annotated, with 402 studies (3076 lesions) released on Synapse as publicly available datasets to challenge competitors. Additionally, 31 studies (139 lesions) were held out for validation, and 59 studies (218 lesions) were used for testing. Segmentation accuracy was measured as rank across subjects, with the winning team achieving a LesionWise mean score of 7.9. The Dice score for the winning team was 0.65 ± 0.25. Common errors among the leading teams included false negatives for small lesions and misregistration of masks in space. The Dice scores and lesion detection rates of all algorithms diminished with decreasing tumor size, particularly for tumors smaller than 100 mm3. In conclusion, algorithms for BM segmentation require further refinement to balance high sensitivity in lesion detection with the minimization of false positives and negatives. The BraTS-METS 2023 challenge successfully curated well-annotated, diverse datasets and identified common errors, facilitating the translation of BM segmentation across varied clinical environments and providing personalized volumetric reports to patients undergoing BM treatment.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10312806/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10113860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
ArXiv
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1