Poravnanje više nizova

Problem poravnanja više nizova svoju svrhu nalazi u svakodnevnoj upotrebi i stoga je od velikog interesa imati na raspolaganju dovoljno dobre metode rješavanja tog problema. Kako je sam problem poravnanja više nizova prilično složen i egzaktno rješavanje u praksi ne dolazi u obzir, u ovom radu dan je pregled poznatih metoda rješavanja, a poseban naglasak stavljen je na metodu rješavanja problema genetskim algoritmom. Provedena je analiza kvalitete dobivenih rješenja s obzirom na određivanje nekih varijabli u samom algoritmu, te je na kraju opisan smjer u kojem bi se potencijalno moglo krenuti u daljnjem istraživanju ove problematike.Multiple sequence analysis is a problem which is encountered daily, therefore, it is very important to have good methods for solving this problem. Because solving multiple sequence alignment problem using dynamic programming would have no practical application, due to complexity of the problem itself, this paper gives some of the most popular methods for solving this problem with emphasis on genetic algorithms. Result quality analysis was made with respect to different methods for assessing various parameters included in the algorithm. Finally, some possibilities for future improvements were discussed

Poravnanje više nizova

Problem poravnanja više nizova svoju svrhu nalazi u svakodnevnoj upotrebi i stoga je od velikog interesa imati na raspolaganju dovoljno dobre metode rješavanja tog problema. Kako je sam problem poravnanja više nizova prilično složen i egzaktno rješavanje u praksi ne dolazi u obzir, u ovom radu dan je pregled poznatih metoda rješavanja, a poseban naglasak stavljen je na metodu rješavanja problema genetskim algoritmom. Provedena je analiza kvalitete dobivenih rješenja s obzirom na određivanje nekih varijabli u samom algoritmu, te je na kraju opisan smjer u kojem bi se potencijalno moglo krenuti u daljnjem istraživanju ove problematike.Multiple sequence analysis is a problem which is encountered daily, therefore, it is very important to have good methods for solving this problem. Because solving multiple sequence alignment problem using dynamic programming would have no practical application, due to complexity of the problem itself, this paper gives some of the most popular methods for solving this problem with emphasis on genetic algorithms. Result quality analysis was made with respect to different methods for assessing various parameters included in the algorithm. Finally, some possibilities for future improvements were discussed

Poravnanje više nizova

Problem poravnanja više nizova svoju svrhu nalazi u svakodnevnoj upotrebi i stoga je od velikog interesa imati na raspolaganju dovoljno dobre metode rješavanja tog problema. Kako je sam problem poravnanja više nizova prilično složen i egzaktno rješavanje u praksi ne dolazi u obzir, u ovom radu dan je pregled poznatih metoda rješavanja, a poseban naglasak stavljen je na metodu rješavanja problema genetskim algoritmom. Provedena je analiza kvalitete dobivenih rješenja s obzirom na određivanje nekih varijabli u samom algoritmu, te je na kraju opisan smjer u kojem bi se potencijalno moglo krenuti u daljnjem istraživanju ove problematike.Multiple sequence analysis is a problem which is encountered daily, therefore, it is very important to have good methods for solving this problem. Because solving multiple sequence alignment problem using dynamic programming would have no practical application, due to complexity of the problem itself, this paper gives some of the most popular methods for solving this problem with emphasis on genetic algorithms. Result quality analysis was made with respect to different methods for assessing various parameters included in the algorithm. Finally, some possibilities for future improvements were discussed