A Pattern Matching Extended Compression Algorithm for DNA Sequences

Murugan., A,Punitha., K International Journal of Computer ScienceNetwork S 2021 International journal of computer science and netw Vol.21 No.8

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

COVERING COVER PEBBLING NUMBER OF A HYPERCUBE & DIAMETER d GRAPHS

A. Lourdusamy,Punitha Tharani 한국수학교육학회 2008 純粹 및 應用數學 Vol.15 No.2

A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The covering cover pebbling number of a graph is the smallest number of pebbles, such that, however the pebbles are initially placed on the vertices of the graph, after a sequence of pebbling moves, the set of vertices with pebbles forms a covering of G. In this paper we find the covering cover pebbling number of n-cube and diameter two graphs. Finally we give an upperbound for the covering cover pebbling number of graphs of diameter d.

Computation of total chromatic number for certain convex polytope graphs

A. Punitha,G. Jayaraman 한국전산응용수학회 2024 Journal of applied mathematics & informatics Vol.42 No.3

A total coloring of a graph $G$ is an assignment of colors to the elements of a graphs $G$ such that no adjacent vertices and edges receive the same color. The total chromatic number of a graph $G$ , denoted by $\chi{''}(G),$ is the minimum number of colors that suffice in a total coloring. In this paper, we proved the Behzad and Vizing conjecture for certain convex polytope graphs $D_{n}^{p},$ $Q_{n}^{p},$ $R_{n}^{p},$ $E_{n},$ $S_{n},$ $G_{n},$ $T_{n},$ $U_{n},$ $C_{n},$respectively. This significant result in a graph $G$ contributes to the advancement of graph theory and combinatorics by further confirming the conjecture's applicability to specific classes of graphs. The presented proof of the Behzad and Vizing conjecture for certain convex polytope graphs not only provides theoretical insights into the structural properties of graphs but also has practical implications. Overall, this paper contributes to the advancement of graph theory and combinatorics by confirming the validity of the Behzad and Vizing conjecture in a graph $G$ and establishing its relevance to applied problems in sciences and engineering.

IoT-Based Automatic Water Quality Monitoring System with Optimized Neural Network

Anusha Bamini A M,Chitra R,아가왈 사우랍,김현성,Punitha Stephan,Thompson Stephan 한국인터넷정보학회 2024 KSII Transactions on Internet and Information Syst Vol.18 No.1

One of the biggest dangers in the globe is water contamination. Water is a necessity for human survival. In most cities, the digging of borewells is restricted. In some cities, the borewell is allowed for only drinking water. Hence, the scarcity of drinking water is a vital issue for industries and villas. Most of the water sources in and around the cities are also polluted, and it will cause significant health issues. Real-time quality observation is necessary to guarantee a secure supply of drinking water. We offer a model of a low-cost system of monitoring real-time water quality using IoT to address this issue. The potential for supporting the real world has expanded with the introduction of IoT and other sensors. Multiple sensors make up the suggested system, which is utilized to identify the physical and chemical features of the water. Various sensors can measure the parameters such as temperature, pH, and turbidity. The core controller can process the values measured by sensors. An Arduino model is implemented in the core controller. The sensor data is forwarded to the cloud database using a WI-FI setup. The observed data will be transferred and stored in a cloud-based database for further processing. It wasn't easy to analyze the water quality every time. Hence, an Optimized Neural Network-based automation system identifies water quality from remote locations. The performance of the feed-forward neural network classifier is further enhanced with a hybrid GA- PSO algorithm. The optimized neural network outperforms water quality prediction applications and yields 91% accuracy. The accuracy of the developed model is increased by 20% because of optimizing network parameters compared to the traditional feed-forward neural network. Significant improvement in precision and recall is also evidenced in the proposed work.

Behavior of CFRP Strengthened CHS under Axial Static and Axial Cyclic Loading

A. Punitha Kumar,R. Senthil 대한토목학회 2016 KSCE JOURNAL OF CIVIL ENGINEERING Vol.20 No.4

Fibre Reinforced Polymer (FRP) wrapping is one of the techniques used to strengthen the concrete structures. Recently these techniques are implemented for the strengthening of steel structures. This study emphasizes on experimental investigation of Carbon Fibre Reinforced Polymer (CFRP) strengthened steel hollow sections under axial static and axial cyclic loading. In CFRP strengthened steel hollow section, number of layers and orientation of layers are the key factors for the prediction of axial capacity. A series of tests were conducted on CFRP strengthened steel Circular Hollow Sections (CHS) by varying the number and orientation of the CFRP layers under axial static and axial cyclic loading. From the experimental results, it was observed that the strength, ductility and stiffness has increased in the CFRP strengthened specimens. The results highlight that the axial load carrying capacity of CFRP strengthened circular hollow steel section has been increased up to 37.13% in static loading and 42.86% in axial cyclic loading. CFRP confinement could be responsible for the increase in the axial capacity of steel hollow section and this method could be used to enhance the performance of existing steel hollow sections.

Total coloring of middle graph of certain snake graph families

A. Punitha,G. Jayaraman 한국전산응용수학회 2024 Journal of applied mathematics & informatics Vol.42 No.2

A total coloring of a graph $G$ is an assignment of colors to both the vertices and edges of $G$, such that no two adjacent or incident vertices and edges of $G$ are assigned the same colors. In this paper, we have discussed the total coloring of $M(T_{n}), M(D_{n}), M(DT_{n}), M(AT_{n}), M(DA(T_{n})),$ $ M(Q_{n}), M(AQ_{n})$ and also obtained the total chromatic number of $M(T_{n}),$ $M(D_{n}), M(DT_{n}), M(AT_{n}), M(DA(T_{n})), M(Q_{n}),M(AQ_{n}).$

An Efficient DNA Sequence Compression using Small Sequence Pattern Matching

Murugan., A,Punitha., K International Journal of Computer ScienceNetwork S 2021 International journal of computer science and netw Vol.21 No.8

Bioinformatics is formed with a blend of biology and informatics technologies and it employs the statistical methods and approaches for attending the concerning issues in the domains of nutrition, medical research and towards reviewing the living environment. The ceaseless growth of DNA sequencing technologies has resulted in the production of voluminous genomic data especially the DNA sequences thus calling out for increased storage and bandwidth. As of now, the bioinformatics confronts the major hurdle of management, interpretation and accurately preserving of this hefty information. Compression tends to be a beacon of hope towards resolving the aforementioned issues. Keeping the storage efficiently, a methodology has been recommended which for attending the same. In addition, there is introduction of a competent algorithm that aids in exact matching of small pattern. The DNA representation sequence is then implemented subsequently for determining 2 bases to 6 bases matching with the remaining input sequence. This process involves transforming of DNA sequence into an ASCII symbols in the first level and compress by using LZ77 compression method in the second level and after that form the grid variables with size 3 to hold the 100 characters. In the third level of compression, the compressed output is in the grid variables. Hence, the proposed algorithm S_Pattern DNA gives an average better compression ratio of 93% when compared to the existing compression algorithms for the datasets from the UCI repository.