Description
Title: SEARCH FOR SUBSTRINGS OF CIRCULAR PATTERNS AND THEIR CONJUGATES IN ONLINE TEXT USING A CHARACTER FREQUENCY-BASED APPROACH
Abstract: In computational biology, dealing with circular patterns is a fundamental problem. Finding a pattern and its rotations in a database is the problem. We present two online algorithms in this paper. The first algorithm displays all of a given pattern’s factors (substrings) in an online text. The algorithm is then expanded to handle the circular rotations of the pattern without sacrificing efficiency. The extended algorithm reports all the locations in the text where a substring of Pc is found, where Pc is one of the rotations of P, for a given pattern P of size M and a text T of size N. The desired goals are attained for an alphabet size using O(M) space in an average of O(MN/σ) time, which is O(N) for all patterns with length M. Advanced data structures like automata and suffix trees are used by conventional string processing algorithms. The experimental data we’ve presented demonstrates that fundamental data structures like arrays can be used in text-processing algorithms without sacrificing effectiveness.
Keywords: pattern matching in strings, circular pattern matching, similarity search, substring search
Paper Quality: SCOPUS / Web of Science Level Research Paper
Paper type: Analysis Based Research Paper
Subject: Computer Science
Writer Experience: 20+ Years
Plagiarism Report: Turnitin Plagiarism Report will be less than 10%
Restriction: Only one author may purchase a single paper. The paper will then indicate that it is out of stock.
What will I get after the purchase?
A turnitin plagiarism report of less than 10% in a pdf file and a full research paper in a word document.
In case you have any questions related to this research paper, please feel free to call/ WhatsApp on +919726999915
Reviews
There are no reviews yet.