Search arXivSearch

arXiv · 1303.0539

Novel Method for Mutational Disease Prediction using Bioinformatics Techniques and Backpropagation Algorithm

Abstract

Cancer is one of the most feared diseases in the world it has increased disturbingly and breast cancer occurs in one out of eight women, the prediction of malignancies plays essential roles not only in revealing human genome, but also in discovering effective prevention and treatment of cancers. Generally cancer disease driven by somatic mutations in an individual DNA sequence, or genome that accumulates during the lifetime of person. This paper is proposed a novel method can predict the disease by mutations despite The presence in gene sequence is not necessary it are malignant, so will be compare the protein of patient with the gene's protein of disease if there is difference between these two proteins then can say there is malignant mutations. This method will use bioinformatics techniques like FASTA, CLUSTALW, etc which shows whether malignant mutations or not, then training the backpropagation algorithm using all expected malignant mutations for a certain genes (e.g. BRCA1 and BRCA2) of disease, and using it to test whether patient is holder the disease or not. Implementing this novel method as the first way to predict the disease based on mutations in the sequence of the gene that causes the disease shows two decisions are achieved successfully, the first diagnose whether the patient has mutations of cancer or not using bioinformatics techniques the second classifying these mutations are related to breast cancer (e.g. BRCA1 and BRCA2) using backpropagation with mean square rate 0.0000001. Keywords-Gene sequence; Protein; Deoxyribonucleic Acid DNA; Malignant mutation; Bioinformatics; Back-propagation algorithm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ayad Ghany Ismaeel, Anar Auda Ablahad. 2013-03-03. Novel Method for Mutational Disease Prediction using Bioinformatics Techniques and Backpropagation Algorithm. https://arxiv.org/abs/1303.0539

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Cosm: Collective switched motion for sparse Ising optimization

We introduce Collective Switched Motion (Cosm), a heuristic optimization framework based on switched collective dynamics. Cosm compiles the objective into subobjectives that are activated sequentially, temporally separating competing local influences. The interplay of switching and local interactions among variables gives rise to collective search behavior, while a new correlated perturbation mechanism encourages coordinated cluster motion. Tests on tuned-hardness spin-glass benchmarks suggest more favorable algorithmic scaling than that reported for leading dynamical solvers. Cosm heuristically attains the certified optima of three of the largest Gset instances (G72, G77, G81), exceeding the previously reported heuristic solutions. On the large random-graph instances G61 and G70, a CPU implementation reliably attains the best-known solutions, reaching cuts of 5799 and 9595 with 99%-confidence times-to-target of 15 s and 2.4 s, respectively. On the heterogeneous-degree G64 instance, Cosm establishes a new best-known cut of 8753. Broadly, the results suggest an alternative approach to heuristic design in which local dynamics and orchestration mechanisms are carefully designed so that effective search emerges.

cs.CE

Decomposing Firm-Level Crisis Responses from Incomplete Market Signals: Evidence from China's IT Sector During COVID-19

Exogenous shocks generate heterogeneous behavioral responses across firms, yet event studies typically report only sector-level averages. This paper develops a multi-method approach combining causal identification (difference-in-differences with cluster-robust inference), unsupervised behavioral discovery (K-means trajectory clustering, Gaussian hidden Markov models), and cross-sectional resilience prediction (logistic regression with nested cross-validation) to decompose firm-level response heterogeneity from noisy market signals. We demonstrate the approach on 246 Chinese A-share IT firms (216 with complete data for all analyses) during the COVID-19 shock (January 2020), using 252 non-IT CSI 300 firms as controls. The return decline was market-wide, not IT-specific (DID p = 0.59); the IT-specific effect was elevated volatility (DID beta = 0.043, cluster-robust p < 0.001), with the effect surviving Benjamini-Hochberg correction in 13 of 30 alternative specifications. Unsupervised clustering produced three trajectory groups: fast recovery (36 companies, +29.7%), resilient/moderate (67 companies), and persistent drag (113 companies, -6.9%). Pre-crisis financial fundamentals showed only modest predictive power for resilience (nested CV AUC = 0.635, 95% CI: 0.558-0.711; permutation p = 0.016), consistent with the limited informativeness of publicly available signals for anticipating crisis outcomes. The combination of causal analysis, unsupervised learning, and prediction represents a reproducible framework which can be applied to crises in other market periods.

cs.CE

An Insurance Broker for Every Small Business: The Economics of Exceptional Care at Scale

Small-business owners need expert guidance on their own terms, across schedules, languages, and channels, but low premiums make exceptional, continuous human service uneconomic for much of the market. Combining public evidence, Kinro operational data, and an illustrative five-year service model, we show why traditional brokerage economics leave 35 million U.S. small businesses underserved. An AI-native brokerage can change those economics by performing and coordinating routine work continuously, while licensed professionals govern consequential exceptions and the brokerage remains accountable.

cs.CE