检索结果-内蒙古大学图书馆

arXiv 2024年

作者： Moreno, Matthew Andres Ranjan, Anika Dolson, Emily Zaman, Luis Department of Ecology and Evolutionary Biology University of Michigan Ann Arbor United States Center for the Study of Complex Systems University of Michigan Ann Arbor United States Michigan Institute for Data and AI in Society University of Michigan Ann Arbor United States Undergraduate Research Opportunities Program University of Michigan Ann Arbor United States Department of Computer Science and Engineering Michigan State University East Lansing United States Program in Ecology Evolution and Behavior Michigan State University East Lansing United States

computer simulations are an important tool for studying the mechanics of biological evolution. In particular, in silico work with agent-based models provides an opportunity to collect high-quality records of ancestry relationships among simulated agents. Such phylogenies can provide insight into evolutionary dynamics within these simulations. Existing work generally tracks lineages directly, yielding an exact phylogenetic record of evolutionary history. However, direct tracking can be inefficient for large-scale, many-processor evolutionary simulations. An alternate approach to extracting phylogenetic information from simulation that scales more favorably is post hoc estimation, akin to how bioinformaticians build phylogenies by assessing genetic similarities between organisms. Recently introduced "hereditary stratigraphy" algorithms provide means for efficient inference of phylogenetic history from non-coding annotations on simulated organisms' genomes. A number of options exist in configuring hereditary stratigraphy methodology, but no work has yet tested how they impact reconstruction quality. To address this question, we surveyed reconstruction accuracy under alternate configurations across a matrix of evolutionary conditions varying in selection pressure, spatial structure, and ecological dynamics. We synthesize results from these experiments to suggest a prescriptive system of best practices for work with hereditary stratigraphy, ultimately guiding researchers in choosing appropriate instrumentation for large-scale simulation studies. Copyright © 2024, The Authors. All rights reserved.

关键词： Biotic

来源：评论

学校读者我要写书评

暂无评论

Dental Disease Detection based on CNN for Panoramic Dental Radiographs

Dental Disease Detection based on CNN for Panoramic Dental R...

引用

IEEE International Conference on Intelligent Computing and Information systems (ICICIS)

作者： Manar El Bagoury Mirna Al-Shetairy Omar Ahmed Samah S Mehanny Tassneem Hamdy Gihan Omar Marwan Akram Rana Mohamed Hebatullah Amr Walaa Gad Bioinformatics Program Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt Computer Science Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt Oral Biology Department Faculty of Dentistry Cairo and Galala Universities Cairo Egypt Oral and Maxillofacial Radiology Department Faculty of Dentistry Cairo University Cairo Egypt Oral Radiology Department Faculty of Oral and Dental Medicine Future University in Egypt Cairo Egypt Information Systems Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

Panoramic dental radiography is one of the examination tools frequently performed in dental clinics and hospitals as it captures a wide range of the dental region and its surroundings, but due to the complex structure of the dental area and lack of time, dentists focus on tiny parts of the images. With the help of Machine Learning, dentists can detect dental defects and anomalies faster and more accurately. In this study, a data set of 733 panoramic radiographs of adult patients was collected from the faculty of Oral and Dental Medicine, Future University, Egypt. Using a combination of pre-trained CNN architecture and a finetuned network, the collected panoramic radiographs were used to determine the optimal architecture. The purpose of this research was to develop a computer-aided detection system based on a finetuned CNN algorithm, and to evaluate the accuracy and usefulness of this system for the detection of proximal and occlusal caries, interdental and inter radicular alveolar bone loss, periapical lesions, and impacted teeth in panoramic radiographs. Different object detection models were tested to detect selected dental diseases that were found in the panoramic radiographs, and after a few experiments, the YOLOv5 architecture was proved to be the most optimal after achieving 0.61 mAP@0.5 and 0.28 mAP@ [0.5-0.95] for the total six classes. This is the best-achieved results to our knowledge.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributional bias compromises leave-one-out cross-validation

arXiv

引用

arXiv 2024年

作者： Austin, George I. Pe’er, Itsik Korem, Tal Department of Biomedical Informatics Columbia University Irving Medical Center New YorkNY United States Program for Mathematical Genomics Department of Systems Biology Columbia University Irving Medical Center New YorkNY United States Department of Computer Science Columbia University New YorkNY United States Department of Obstetrics and Gynecology Columbia University Irving Medical Center New YorkNY United States

Cross-validation is a common method for estimating the predictive performance of machine learning models. In a data-scarce regime, where one typically wishes to maximize the number of instances used for training the model, an approach called ‘leave-one-out cross-validation’ is often used. In this design, a separate model is built for predicting each data instance after training on all other instances. Since this results in a single test data point available per model trained, predictions are aggregated across the entire dataset to calculate common rank-based performance metrics such as the area under the receiver operating characteristic or precision-recall curves. In this work, we demonstrate that this approach creates a negative correlation between the average label of each training fold and the label of its corresponding test instance, a phenomenon that we term distributional bias. As machine learning models tend to regress to the mean of their training data, this distributional bias tends to negatively impact performance evaluation and hyperparameter optimization. We show that this effect generalizes to leave-P-out cross-validation and persists across a wide range of modeling and evaluation approaches, and that it can lead to a bias against stronger regularization. To address this, we propose a generalizable rebalanced cross-validation approach that corrects for distributional bias. We demonstrate that our approach improves cross-validation performance evaluation in synthetic simulations and in several published leave-one-out analyses. © 2024, CC BY-SA.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams

arXiv

引用

arXiv 2024年

作者： Moreno, Matthew Andres Zaman, Luis Dolson, Emily Department of Ecology and Evolutionary Biology Ann Arbor United States Center for the Study of Complex Systems Ann Arbor United States Michigan Institute for Data and AI in Society Ann Arbor United States University of Michigan Ann Arbor United States Department of Computer Science and Engineering East Lansing United States Program in Ecology Evolution and Behavior East Lansing United States Michigan State University East Lansing United States

Operations over data streams typically hinge on efficient mechanisms to aggregate or summarize history on a rolling basis. For high-volume data steams, it is critical to manage state in a manner that is fast and memory efficient - particularly in resource-constrained or real-time contexts. Here, we address the problem of extracting a fixed-capacity, rolling subsample from a data stream. Specifically, we explore "data stream curation" strategies to fulfill requirements on the composition of sample time points retained. Our "DStream" suite of algorithms targets three temporal coverage criteria: (1) steady coverage, where retained samples should spread evenly across elapsed data stream history;(2) stretched coverage, where early data items should be proportionally favored;and (3) tilted coverage, where recent data items should be proportionally favored. For each algorithm, we prove worst-case bounds on rolling coverage quality. In contrast to previous work by Moreno, Rodriguez Papa, and Dolson (2024), which dynamically scales memory use to guarantee a specified level of coverage quality, here we focus on the more practical, application-driven case of maximizing coverage quality given a fixed memory capacity. As a core simplifying assumption, we restrict algorithm design to a single update operation: writing from the data stream to a calculated buffer site - with data never being read back, no metadata stored (e.g., sample timestamps), and data eviction occurring only implicitly via overwrite. Drawing only on primitive, low-level operations and ensuring full, overhead-free use of available memory, this "DStream" framework ideally suits domains that are resource-constrained (e.g., embedded systems), performance-critical (e.g., real-time), and fine-grained (e.g., individual data items as small as single bits or bytes). In particular, proposed power-of-two-based buffer layout schemes support O(1) data ingestion via concise bit-level operations. To further practical applica

关键词： Data streams

来源：评论

学校读者我要写书评

暂无评论

Biomedical data and AI

引用

science China Life sciences 2025年第5期68卷 1536-1540页

作者： Hao Xu Shibo Zhou Zefeng Zhu Vincenzo Vitelli Liangyi Chen Ziwei Dai Ning Yang Luhua Lai Shengyong Yang Sergey Ovchinnikov Zhuoran Qiao Sirui Liu Chen Song Jianfeng Pei Han Wen Jianfeng Feng Yaoyao Zhang Zhengwei Xie Yang-Yu Liu Zhiyuan Li Fulai Jin Hao Li Mohammad Lotfollahi Xuegong Zhang Ge Yang Shihua Zhang Ge Gao Pulin Li Qi Liu Jing-Dong Jackie Han Peking-Tsinghua Center for Life Sciences (CLS) Academy for Advanced Interdisciplinary StudiesPeking University Center for Quantitative Biology (CQB) Academy for Advanced Interdisciplinary StudiesPeking University Peking University-Tsinghua University-National Institute of Biological Sciences Joint Graduate Program Academy for Advanced Interdisciplinary StudiesPeking University Department of Physics University of Chicago School of Life Sciences Southern University of Science and Technology Peking University Chengdu Academy for Advanced Interdisciplinary Biotechnologies College of Chemistry and Molecular Engineering Peking University Department of Biotherapy Cancer Center and State Key Laboratory of BiotherapyWest China HospitalSichuan University Department of Biology Massachusetts Institute of Technology Lambic Therapeutics Inc. Changping Laboratory Al for Science Institute Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Department of Obstetrics and Gynecology West China Second University HospitalSichuan University Peking University International Cancer Institute and Peking University-Yunnan Baiyao International Medical Institute and State Key Laboratory of Natural and Biomimetic Drugs Department of Molecular and Cellular PharmacologySchool of Pharmaceutical SciencesPeking University Health Science CenterPeking University Channing Division of Network Medicine Department of MedicineBrigham and Women's Hospital and Harvard Medical School Center for Artificial Intelligence and Modeling the Carl R.Woese Institute for Genomic BiologyUniversity of Illinois Urbana-Champaign Department of Genetics and Genome Sciences School of Medicine and Department of Computer and Data Sciences and Department of Population and Quantitative Health SciencesCase Western Reserve University Department of Biochemistry and Biophysics University of California Sanger Institute Department of Automation Tsinghua University State Key Laboratory of Multimodal Artificial Intelligence Systems I

The development of artificial intelligence(AI) and the mining of biomedical data complement each other. From the direct use of computer vision results to analyze medical images for disease screening, to now integrating biological knowledge into models and even accelerating the development of new AI based on biological discoveries, the boundaries of both are constantly expanding, and their connections are becoming closer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

K-Means Clustering Model to Discriminate Copper-Resistant Bacteria as Bioremediation Agents

引用

Procedia computer science 2021年 179卷 804-812页

作者： Ika Nurlaila Wahyu Irawati Kartika Purwandari Bens Pardamean Information Systems Department BINUS Online Learning Bina Nusantara University Jakarta Indonesia 11480 Department of Biology Education Faculty of Education Pelita Harapan University Tangerang Indonesia 15811 Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department BINUS Graduate Program - Master of Computer Science Bina Nusantara University Jakarta Indonesia 11480

Copper (Cu) has been excessively used for some valuable commodities and this creates environmental problems. The inorganic element becomes toxic when presents beyond the recommended tolerated concentration. Bacterial-based remediation is seen to be an excellent tool to overcome it as it reduces the copper contamination without yielding any other forms of contamination. There are some pivotal properties in the bacteria render them being considered as bioremediation agents against coppers contamination, namely bioaccumulation and biosorption. In the present study, we question if these bacteria could be clustered into a strong and representative proximity according to their functional properties. Mostly, bacteria are grouped based on their genetic profiles derived from the 16S rRNA sequencing. We propose that our K-Means clustering model can be employed to identify genetically-unlabelled bacteria. But first, a prominent reference should be developed and we are in this phase. We figured out the K-Means clustering model do not pull the same-genus bacteria into the same cluster. Instead, the model gathers into a proximity those isolates with similarity on a functional characteristic termed minimum inhibitory concentration (MIC), regardless their origins and their hierarchy in taxonomy.

关键词： Copper-Resistant Bacteria K-Means Minimum Inhibitory Concentration

来源：评论

学校读者我要写书评

暂无评论

Spatial atlas of the mouse central nervous system at molecular resolution (vol 622, pg 552, 2023)

引用

NATURE 2024年第7993期625卷 E6-E6页

作者： Shi, Hailing He, Yichun Zhou, Yiming Huang, Jiahao Maher, Kamal Wang, Brandon Tang, Zefang Luo, Shuchen Tan, Peng Wu, Morgan Lin, Zuwan Ren, Jingyi Thapa, Yaman Tang, Xin Chan, Ken Y. Deverman, Benjamin E. Shen, Hao Liu, Albert Liu, Jia Wang, Xiao Broad Institute of MIT and Harvard Cambridge MA USA Department of Chemistry Massachusetts Institute of Technology Cambridge MA USA John A. Paulson School of Engineering and Applied Sciences Harvard University Boston MA USA Computational and Systems Biology PhD Program Massachusetts Institute of Technology Cambridge MA USA Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge MA USA Department of Biology Massachusetts Institute of Technology Cambridge MA USA Klarman Cell Observatory Broad Institute of MIT and Harvard Cambridge MA USA Department of Chemistry and Chemical Biology Harvard University Cambridge MA USA Stanley Center for Psychiatric Research Broad Institute of MIT and Harvard Cambridge MA USA

来源：评论

学校读者我要写书评

暂无评论

FaNDOM: Fast Nested Distance-Based Seeding of Optical Maps

SSRN

引用

SSRN 2021年

作者： Dehkordi, Siavash Raeisi Luebeck, Jens Bafna, Vineet Department of Computer Science & Engineering University of California San Diego San diegoCA92093 United States Bioinformatics & Systems Biology Graduate Program University of California San Diego San diegoCA92093 United States

Optical mapping provides single-molecule readouts of the locations of fluorescently labeled sequence motifs on long fragments of DNA, resolved to nucleotide-level coordinates. With the advent of microfluidic technologies for manipulating large numbers of individual molecules, and advances in the imaging of fluorescent DNA tags, it is possible to inexpensively generate high coverage and long OM molecules (>150Kbp). In addition to its use in scaffolding for de novo assembly, optical map data can also be mapped to a reference for identifying genetic structural variants implicated in Mendelian diseases and cancer. To address the computational challenge, we introduce FaNDOM (Fast Nested Distance seeding of Optical Maps) - an optical map alignment tool which greatly reduces the search space of the alignment process. On 4 benchmark human data-sets, FaNDOM was significantly (4-14X) faster than competing tools while maintaining comparable sensitivity and specificity. We used FaNDOM to map variants in 3 cancer cell-lines and identified many structural variations, including deletion of tumor-suppressor genes, duplications, gene fusions and gene-disrupting rearrangements. FaNDOM is publicly available at (https://***/jluebeck/FaNDOM). © 2021, The Authors. All rights reserved.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

BPS2025 - Systematic embedding of biomechanics within dynamical graph grammars with application to actin networks in dendritic spine heads

引用

Biophysical Journal 2025年第3期124卷 206a-206a页

作者： Eric Mjolsness Matthew Hur Thomas M. Bartol Terrence J. Sejnowski Departments of Computer Science and Mathematics University of California Irvine Irvine CA USA Mathematical Computational and Systems Biology Program University of California Irvine Irvine CA USA Computational Neurobiology Laborartory Salk Institute for Biological Studies San Diego CA USA

来源：评论

学校读者我要写书评

暂无评论

Periodicity Scoring of Time Series Encodes Dynamical Behavior of the Tumor Suppressor p53 ⁎ ⁎

引用

IFAC-PapersOnLine 2021年第9期54卷 488-495页

作者： Caroline Moosmüller Christopher J. Tralie Mahdi Kooshkbaghi Zehor Belkhatir Maryam Pouryahya José Reyes Joseph O. Deasy Allen R. Tannenbaum Ioannis G. Kevrekidis C. Moosmüller and C. Tralie contributed equally to this work Department of Mathematics University of California San Diego La Jolla CA 92093 USA Department of Medical Physics Memorial Sloan-Kettering Cancer Center NY USA Department of Chemical and Biomolecular Engineering Johns Hopkins University Baltimore MD 21218 USA Department of Mathematics and Computer Science Ursinus College Collegeville PA USA Program in Applied and Computational Mathematics Princeton University NJ USA School of Engineering and Sustainable Development De Montfort University Leicester UK Cancer Biology and Genetics Program and Computational and Systems Biology Program Memorial Sloan-Kettering Cancer Center New York NY 10065 USA and Department of Systems Biology Harvard Medical School Boston MA 02115 USA Departments of Computer Science and Applied Mathematics & Statistics Stony Brook University NY USA

In this paper we analyze the dynamical behavior of the tumor suppressor protein p53, an essential player in the cellular stress response, which prevents a cell from dividing if severe DNA damage is present. When this response system is malfunctioning, e.g. due to mutations in p53, uncontrolled cell proliferation may lead to the development of cancer. Understanding the behavior of p53 is thus crucial to prevent its failing. It has been shown in various experiments that periodicity of the p53 signal is one of the main descriptors of its dynamics, and that its pulsing behavior (regular vs. spontaneous) indicates the level and type of cellular stress. In the present work, we introduce an algorithm to score the local periodicity of a given time series (such as the p53 signal), which we call Detrended Autocorrelation Periodicity Scoring (DAPS). It applies pitch detection (via autocorrelation) on sliding windows of the entire time series to describe the overall periodicity by a distribution of localized pitch scores. We apply DAPS to the p53 time series obtained from single cell experiments and establish a correlation between the periodicity scoring of a cell’s p53 signal and the number of cell division events. In particular, we show that high periodicity scoring of p53 is correlated to a low number of cell divisions and vice versa. We show similar results with a more computationally intensive state-of-the-art periodicity scoring algorithm based on topology known as Sw1PerS. This correlation has two major implications: It demonstrates that periodicity scoring of the p53 signal is a good descriptor for cellular stress, and it connects the high variability of p53 periodicity observed in cell populations to the variability in the number of cell division events.

关键词： systems biology cellular systems time series modeling bioinformatics computational biology

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：