Fast Dynamic Programming Based Sequence Alignment Algorithm

An Integrated Approach for Protein Structure Prediction Using Artificial Neural Network

“…Yi Pan [13] described ways for the prediction of protein structure with the help of machine learning techniques. This research focus relies on performance of neural network systems, support vector machines combined with decision tree and association rules.…”

“…There are 64 possible codon types in prediction of protein [13,24]. These codons comprise of tri-nucleotide bases like TTT, TTC, TTA, TTG, TCT, TCC, TCA, TCG, TAT, TAC, TAA, TAG, TGT, TGC, TGA, TGG as there is more than one pattern associated with one protein type.…”

Genome Sequence Analysis: A Survey

“…Proposed an approach for building Incorporates both genomic and Efforts and labor involves in Table 4: continue Sequence Solution of sequence alignment Require less time and space to solve the Internal calculation are complex [13,17,31,36] alignment problem sequence analysis problem, is also and computational stuff is suitable for other local and global involved sequence optimization problems, can handle both small and large sequences Sequence Multi sequence alignment using Enhances the performance of genetic Local search may degrade the [18,29] alignment fuzzy logic algorithm, the probability of three system performance, scoring operations of genetic algorithm are matrix and space quite fast and accurate and align scores concept are more sequences more efficiently traditional Sequence Sequence matching using fuzzy…”

“…Rashid [13] shows a fast dynamic programming based sequence alignment algorithm uses the reduced amino acids alphabet to transform the protein sequences into a sequence of integers and uses n-gram to reduce the length of the sequence and then traditional approach is used to get the similarity measure between two sequences [13] . The results of this proposed approach seem to be quite satisfactory as compared to traditional approaches.…”

“…storage and genome data-ware house functional data, can provide better construction of huge genomic retrieval effective analysis of genetic data sequence data with lot of memory requirement and computation Sequence Multi sequence alignment with Proposed approach provides scalable Grid computing with distributed [8,11,15,19] alignment restricted domain and efficient results in distributed grid environment may require more environment with lower computation resources that cost than cost traditional approaches Sequence Proposed a heuristic approach for Approach is more good than Require comprehensive illustration [7,11,14,18] alignment multi sequence alignment CLUSTALW2 and there is with examples and results, more considerable efficiency by lower work is required to get some running time, the alignment process is solid results more dynamic Sequence Multi sequence alignment with Computational approach for MSA With the increase of more multi [11,12,19] alignment restricted domain with set of clusters brings more good sequences, the performance will results than CLUSTALW2 degrade, is feasible for small domain only Sequence Streaming approach for multi Researchers have reformed the dynamic System graphic hardware [10,13,16] alignment sequence alignment programming algorithm and used primitives, suitable graphic streaming approach for better results, hardware is mandatory for it is claimed to be highly efficient with implementing idea introduction of graphic hardware Sequence An improved ant colony Can operate on any genomic sequence Finding small set of sequence data [10,15] alignment algorithm for multi sequence of any length, avoids local optimum in large data set may slow down alignment problem and brings efficient and robust the system and may bring faulty results results Sequence An improved algorithm for multi Takes help from dynamic Initially a better choice is [7,12,19] alignment sequence alignment programming matrix, much more mandatory for sequence of motifs efficient than traditional approach that otherwise results will be difficult uses some kind of weighted automata to get accurate Sequence An integrated approach for multi Proposed an idea to traverse dynamic Implementation of an arbitrary [8,9,13] alignment sequence alignment matrix anti-diagonally with avoidance dynamic matrix is more difficult of non optimal paths, manage than an ordinary two dimension memory efficiently by matrix divide and conquer technique Sequence Sequence alignment algorithm Requires less space and brings more In thi...…”