Papers by J.A.M.Rexie 1522
AIP Conference Proceedings
Comprehensive tool for supporting applications using the java programming language is the spring ... more Comprehensive tool for supporting applications using the java programming language is the spring framework. Java is used by many web applications and other technologies, and the spring framework provides a range of resources to integrate applications, streamline code, and promote more effective development strategies in general. Spring systems have different features such as ioc, aop, and transaction management, make them different and useful from the other frameworks. The usage of spring architecture in the industries and proclaimed services of the spring framework is focused.
Computational Intelligence and Neuroscience, Sep 8, 2022
An area of medical science, that is, gaining prominence, is DNA sequencing. Genetic mutations res... more An area of medical science, that is, gaining prominence, is DNA sequencing. Genetic mutations responsible for the disease have been detected using DNA sequencing. e research is focusing on pattern identi cation methodologies for dealing with DNAsequencing problems relating to various applications. A few examples of such problems are alignment and assembly of short reads from next generation sequencing (NGS), comparing DNA sequences, and determining the frequency of a pattern in a sequence. e approximate matching of DNA sequences is also well suited for many applications equivalent to the exact matching of the sequence since the DNA sequences are often subject to mutation. Consequently, recognizing pattern similarity becomes necessary. Furthermore, it can also be used in virtually every application that calls for pattern matching, for example, spell-checking, spam ltering, and search engines. According to the traditional approach, nding a similar pattern in the case where the sequence length is l s and the pattern length is l p occurs in O (l s * l p). is heavy processing is caused by comparing every character of the sequence repeatedly with the pattern. e research intended to reduce the time complexity of the pattern matching by introducing an approach named "optimized pattern similarity identi cation" (OPSI). is methodology constructs a table, entitled "shift beyond for avoiding redundant comparison" (SBARC), to bypass the characters in the texts that are already compared with the pattern. e table pertains to the information about the character distance to be skipped in the matching. OPSI discovers at most spots of similar patterns occur in the sequence (by ignoringè mismatches). e experiment resulted in the time complexity identi ed as O (l s .è). In comparison to the size of the pattern, the allowed number of mismatches will be much smaller. Aspects such as scalability, generalizability, and performance of the OPSI algorithm are discussed. In comparison with the hamming distance-based approximate pattern matching algorithm, the proposed algorithm is found to be 69% more e cient.
Uploads
Papers by J.A.M.Rexie 1522