unknown
oaioai:dk.um.si:IzpisGradiva.php?id=40633

MULTIPLE ALIGNMENT OF NUCLEOTIDE OR PROTEIN SEQUENCES

Abstract

Hkratna poravnava več DNK ali proteinskih zaporedij je eno najpogostejših opravil na področju bioinformatike. Uporabna je za filogenetsko analizo, detekcijo homologije med sekvenciranim genom in obstoječo družino genov ter za napovedovanje strukture proteinov. Uporaba eksaktnega algoritma je zaradi eksponentne zahtevnosti problema v praksi nemogoča. Namen tega dela je preučitev računalniških hevrističnih algoritmov, ki so se razširili kot alternativa ročni poravnavi več zaporedij. V okviru tega sta bila implementirana in ocenjena dva algoritma, ki sta se že v osnovni različici izkazala za dovolj natančna in učinkovita za uporabo na realnih zaporedjih. V delu so predstavljeni rezultati testiranja algoritmov ter nadaljnje možnosti raziskovanja.The simultaneous alignment of a number of DNA or protein sequences is one of the most common tasks in bioinformatics. It is useful for phylogenetic analysis, detection of homology between a newly sequenced gene and an existing gene family and for prediction of protein structure. The use of an exact algorithm is practically impossible due to the exponential nature of the problem. The goal of this work is to study several heuristic computer algorithms that have emerged as an alternative to manual alignment construction. Two algorithms have been implemented and evaluated. They have been considered effective enough for construction of real-life multiple sequence alignments. Test results are shown and suggestions for further studies are given

Similar works

Full text

thumbnail-image

Digital library of University of Maribor

Provided a free PDF
oaioai:dk.um.si:IzpisGradiva.php?id=40633Last time updated on 11/18/2016View original full text link

This paper was published in Digital library of University of Maribor.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.