Abstract
Identification of candidate genes and nucleotides are basic uses of the Bioinformatics research. Biology that deals with molecule has functional as well as structural behavior imparting need of well-furnished techniques to distinguish the molecules. Parameterized matching is one of those techniques which deal in identifying molecules having different functional and structural behavior. The word “Parameterized” represent the characters or symbols in the form of parameters. It implies that the sequence of characters forming text and pattern are matched if and only if the bijective mapping is formed between them. Exponential increase in the size of data sets leads the requirement to solve this matching problem in sub-linear time. This paper displays the review of single pattern parameterized pattern matching algorithms using q-grams having linear time complexities. It also discusses about the best algorithm that has less number of false matches. The comparisons done are based on certain criteria's presenting pros and cons of the algorithms.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
