Search

Purpose. As a scientific field, bioinformatics has drawn remarkable attention from various fields, such as information technology, mathematics, and modern biological sciences, in recent years. The topic models originating from the field of natural language processing have become the focus of attention with the rapid accumulation of biological datasets. Thus, this research is aimed at modeling the topic content of the bioinformatics literature presented by Iranian researchers in the Scopus Citation Database. Methodology. This research was a descriptive-exploratory study, and the studied population included 3899 papers indexed in the Scopus database, which had been indexed in this database until March 9, 2022. The topic modeling was then performed on the abstracts and titles of the papers. A combination of LDA and TF-IDF was utilized for topic modeling. Findings. The data analysis with topic modeling resulted in identifying seven main topics "Molecular Modeling," "Gene Expression," "Biomarker," "Coronavirus," "Immunoinformatics," "Cancer Bioinformatics," and "Systems Biology." Moreover, "Systems Biology" and "Coronavirus" had the largest and smallest clusters, respectively. Conclusion. The present investigation demonstrated an acceptable performance for the LDA algorithm in classifying the topics included in this field. The extracted topic clusters indicated excellent consistency and topic connection with each other. [ABSTRACT FROM AUTHOR]

The spiculation sign is one of the main signs to distinguish benign and malignant pulmonary nodules. In order to effectively extract the image feature of a pulmonary nodule for the spiculation sign distinguishment, a new spiculation sign recognition model is proposed based on the doctors' diagnosis process of pulmonary nodules. A maximum density projection model is established to fuse the local three-dimensional information into the two-dimensional image. The complete boundary of a pulmonary nodule is extracted by the improved Snake model, which can take full advantage of the parallel calculation of the Spike Neural P Systems to build a new neural network structure. In this paper, our experiments show that the proposed algorithm can accurately extract the boundary of a pulmonary nodule and effectively improve the recognition rate of the spiculation sign. [ABSTRACT FROM AUTHOR]

In this paper, we have used an agent-based stochastic tumor growth model and presented a mathematical and theoretical perspective to cancer therapy. This perspective can be used to theoretical study of precision medicine and combination therapy in individuals. We have conducted a series of in silico combination therapy experiments. Based on cancer drugs and new findings of cancer biology, we hypothesize relationships between model parameters which in some cases represent individual genome characteristics and cancer drugs, i.e., in our approach, therapy players are delegated by biologically reasonable parameters. In silico experiments showed that combined therapies are more effective when players affect tumor via different mechanisms and have different physical dimensions. This research presents for the first time an algorithm as a theoretical viewpoint for the prediction of effectiveness and classification of therapy sets. [ABSTRACT FROM AUTHOR]

One major limiting factor that prevents the accurate delineation of vessel boundaries has been the presence of blurred boundaries and vessel-like structures. Overcoming this limitation is exactly what we are concerned about in this paper. We describe a very different segmentation method based on a cascade-AdaBoost-SVM classifier. This classifier works with a vessel axis + cross-section model, which constrains the classifier around the vessel. This has the potential to be both physiologically accurate and computationally effective. To further increase the segmentation accuracy, we organize the AdaBoost classifiers and the Support Vector Machine (SVM) classifiers in a cascade way. And we substitute the AdaBoost classifier with the SVM classifier under special circumstances to overcome the overfitting issue of the AdaBoost classifier. The performance of our method is evaluated on synthetic complex-structured datasets, where we obtain high overlap ratios, around 91%. We also validate the proposed method on one challenging case, segmentation of carotid arteries over real clinical datasets. The performance of our method is promising, since our method yields better results than two state-of-the-art methods on both synthetic datasets and real clinical datasets. [ABSTRACT FROM AUTHOR]

Accurate target delineation of CT image is a critical step in radiotherapy treatment planning. This paper describes a novel strategy for automatic contour propagation, based on deformable registration, for CT images of lung cancer. The proposed strategy starts with a manual-delineated contour in one slice of a 3D CT image. By means of feature-based deformable registration, the initial contour in other slices of the image can be propagated automatically, and then refined by active contour approach. Three algorithms are employed in the strategy: the Speeded-Up Robust Features (SURF), Thin-Plate Spline (TPS), and an adapted active contour (Snake), used to refine and modify the initial contours. Five pulmonary cancer cases with about 400 slices and 1000 contours have been used to verify the proposed strategy. Experiments demonstrate that the proposed strategy can improve the segmentation performance in the pulmonary CT images. Jaccard similarity (JS) mean is about 0.88 and the maximum of Hausdorff distance (HD) is about 90%. In addition, delineation time has been considerably reduced. The proposed feature-based deformable registration method in the automatic contour propagation improves the delineation efficiency significantly. [ABSTRACT FROM AUTHOR]

Ancestral sequence reconstruction is a well-known problem in molecular evolution. The problem presented in this study is inspired by sequence reconstruction, but instead of leaf-associated sequences we consider only their lengths. We call this problem ancestral gene length reconstruction. It is a problem of finding an optimal labeling which minimizes the total length's sum of the edges, where both a tree and nonnegative integers associated with corresponding leaves of the tree are the input. In this paper we give a linear algorithm to solve the problem on binary trees for the Manhattan cost function S(v, w) = |π(v) - π(w) |. [ABSTRACT FROM AUTHOR]