| Summary: | 碩士 === 國立臺北教育大學 === 資訊科學系碩士班 === 101 === Sequence Alignment plays an important role in bioinformatics. Sequence Alignment is devised into two type : Pairwise Sequence Alignment (PSA) and Multiple Sequence Alignment (MSA), they are always used on DNA and RNA to find similarity and Longest Common Subsequences (LCS), so as to find the sequence's Homology and Similarity and then reason their functionality and whether come from same ancestors. We will research that the problem of finding a particular substring in a string. Directly research string compared algorithms, Rabin-Karp algorithms, Boyer-Moor algorithms, Dynamic Programming and Particle Swarm Optimization Algorithm other well-known algorithms as well as their worst-time complexity in order to explore its strengths and weaknesses, so as to apply the best comparison way for compared DNA.
|
|---|
