Identification of Protein Coding Regions in Genomic DNA Using Unsupervised FMACA Based Pattern Classifier

Pokkuluri Kiran Sree; Inampudi Ramesh Babu

Home/Archive/arXiv

arXiv · 1401.6484

Identification of Protein Coding Regions in Genomic DNA Using Unsupervised FMACA Based Pattern Classifier

Pokkuluri Kiran Sree·Inampudi Ramesh Babu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Genes carry the instructions for making proteins that are found in a cell as a specific sequence of nucleotides that are found in DNA molecules. But, the regions of these genes that code for proteins may occupy only a small region of the sequence. Identifying the coding regions play a vital role in understanding these genes. In this paper we propose a unsupervised Fuzzy Multiple Attractor Cellular Automata (FMCA) based pattern classifier to identify the coding region of a DNA sequence. We propose a distinct K-Means algorithm for designing FMACA classifier which is simple, efficient and produces more accurate classifier than that has previously been obtained for a range of different sequence lengths. Experimental results confirm the scalability of the proposed Unsupervised FCA based classifier to handle large volume of datasets irrespective of the number of classes, tuples and attributes. Good classification accuracy has been established.

Explore related subjects

cs.CE cs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Pokkuluri Kiran Sree, Inampudi Ramesh Babu. 2014-01-25. Identification of Protein Coding Regions in Genomic DNA Using Unsupervised FMACA Based Pattern Classifier. https://arxiv.org/abs/1401.6484

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

KEEP EXPLORING

Related papers

arXiv2026

Centering Drives Normalization Gains: Price-Offset Nuisances in Cross-Sectional Return Prediction

Cross-sectional return prediction from raw intraday bars is sensitive to each instrument price level, an additive nuisance under a return-ranking hypothesis. We test whether removing this offset, rather than rescaling amplitudes or changing the encoder, explains gains on a point-in-time CSI~300 five-minute panel. We evaluate eight parameter-matched encoders with and without RevIN normalization; a parameter-free ladder then separates identity, scale-only, centering, last-value referencing, differencing, and standardization across all fields and restricted channels. Centering drives the reliable effect, while scale-only normalization does not help. All eight paired effects are positive and survive Holm correction on raw rank IC, after style residualization, and after further residualizing on short-term reversal. Among six stronger encoders, gains of 0.0376-0.0567 exceed the 0.0109 spread of normalized IC (0.0830-0.0939). Price-only standardization retains 93--101% of the all-field gain. These results place the main effect in transformed price-channel offset removal rather than amplitude scaling or encoder choice.

cs.CE↗

arXiv2026

AFT Neural Function Approximators for 1D Nonlinear Force Laws

Nonlinear contacts and friction strongly influence the vibration response of assembled structures, but their accurate numerical treatment is computationally demanding. The harmonic balance method is widely used to compute periodic steady-state responses, yet the required alternating frequency-time scheme becomes costly for nonsmooth and hysteretic nonlinearities and must be repeated throughout the nonlinear solution process. Here we show that this procedure can be replaced by neural networks that directly map displacement Fourier coefficients to nonlinear force coefficients and provide the corresponding Jacobian through automatic differentiation. The surrounding solver and continuation algorithms remain unchanged for the computation of frequency response curves. The neural networks exclusively learn individual nonlinear elements rather than complete system responses. Physics-based nondimensionalization and phase normalization facilitate the learning process and enable a single trained network to cover a wide range of parameter combinations. Building on the cubic spring, unilateral spring, and Jenkins elements considered here, the approach points toward a reusable library of nonlinear-element surrogates that can be combined in arbitrary number and location within a mechanical system. By bypassing the iterative force evaluation in time domain, the method offers favorable computational scaling for high-resolution analyses and systems with many nonlinear elements.

cs.CE↗

arXiv2026

Dynamic production control and deadlock prevention in conveyor equipped manufacturing systems

Flexible CONWIP approaches enable the dynamic production control to align production performance with production targets in the presence of high-fluctuating demand and system variability. However, frequently changing the WIP level might generate nervousness and, thus, can be practically infeasible. This paper investigates the combined use of job sequencing and routing to enable dynamic control in a CONWIP system comprising six unreliable workstations interconnected by conveyor carousels. Job sequencing and routing have been investigated using scenario analysis and discrete-event simulation. The results shed light on the effectiveness of the proposed approach, which improves throughput and enables dynamic production control without changing the WIP level. The results also provide managerial insights for system design, considering the impacts of the job-handling system (transport) and the minimum digital and technological requirements from Industry 4.0 for implementing the proposed approach.

cs.CE↗