Changes
no edit summary
<p>"Algorithms are very important in computer Science. The best chosen algorithm makes sure computer will do the given task at best possible manner. In cases where efficiency matter a proper algorithm is really vital to be used. An algorithm is important in optimizing a computer program according to the available resources. " (https://www.linkedin.com/pulse/importance-algorithm-its-types-shibaji-debnath)</p>
<p> </p>
<p>It is hard to think the alignment algorithm myself, so I searched on Google. </p>
<p>There was a very powerful algorithm. Scoring the alignment and showing the best scored alignment results.</p>
<p>This argorithm is called "Needleman-Wunsch algorithm". If you want to know detail, follow the links below.</p>
<p><u>https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm</u> (Wikipedia)</p>
<p><u>http://web.skhu.ac.kr/~mckim1/Lecture/DS/dna/class13/class13_04.html </u><br />
<u>Video Lecture : https://www.youtube.com/watch?v=-0gG_rOhcT8</u></p>
<p> </p>
'AGACATACTAATTCGGTCCATTATA';</p>
<p>Because they have <strong>same length(25b1)</strong>, the algorithm is simple,Start with 5'end base of sequences. </p>
<p>(12) Start with 5'nbsp;end Compare it with base of first one other sequencewhether they are same or not. </p>
<p>(23) Compare it with base of second sequence whether If they are same or not, "Score"+1. If they are different, "Score"-1. Do this work until the 3'end base.</p>
<p>(4) Repeat (2) and (3) If they are same, remain the basewith putting gaps. If they are differentWhenever putting gaps, put "-Score" instead of existing base.-2,</p>
<p> </p>
<p>I thought it could be utilized in very restrictive condition, so I wanted to make "Master Code" that could be utilized in any conditionPerl code was available on google (https://www.perlmonks.org/?node_id=819506)</p>
<p>It is hard to think myself, so But it was not work because of some errors. I searched on Googlejust fixed some parts of it. <br />[[Code for alignment]]</p>
<p>There was a very powerful algorithm. Scoring the alignment and showing the best scored alignment results.</p> <p>This argorithm is called "Needleman-Wunsch algorithm". If you want to know detail, follow the links below.</p> <p><u>https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm</u> (Wikipedia)</p> <p><u>http://web.skhu.ac.kr/~mckim1/Lecture/DS/dna/class13/class13_04.html </u><br /><u>Video Lecture : https://www.youtube.com/watch?v=-0gG_rOhcT8</u></p>
<p> </p>