| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font
First page > Show document

Show document Help

Title:PRIMERJAVA UČINKOVITOSTI IMPLEMENTACIJE ALGORITMOV NEEDLEMAN-WUNSCH IN SMITH-WATERMAN ZA PORAVNAVO ZAPOREDIJ V BIOINFORMATIKI
Authors:ID Matjašec, Matej (Author)
ID Verber, Domen (Mentor) More about this mentor... New window
Files:.pdf MAG_Matjasec_Matej_2016.pdf (1,47 MB)
MD5: C44BF95A93571816B10A5C2FA9D31A21
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FZV - Faculty of Health Sciences
Abstract:Raziskovana in primerjana je učinkovitost implementacij algoritmov Needleman-Wunscha in Smith-Watermana za primerjave zaporedij na področju bioinformatike. Na podlagi implementacij smo nad enakimi podatki merili čase izvajanja v programskima jezikoma C++, Perl in statističnem jeziku R. Metodologija raziskovanja: Teoretična podlaga magistrske naloge temelji na ustreznih objavah različnih avtorjev in spletnih virov. Rezultati: Pri času izvajanja algoritmov v programskem jeziku C++ krajši vhodni niz ne presega 1 ms in daljši vhodni niz ne presega 15 ms. Pri programskem jeziku Perl in statičnem jeziku R, kjer se čas izvajanja z dolžino niza eksponentno povečuje. Sklep: Čas izvajanja algoritmov Needleman-Wunscha in Smith-Watermana z enakimi vhodnimi podatki v programskem jeziku C++, je krajši kot v programskem jeziku Perl ali statističnem jeziku R.
Keywords:poravnava zaporedij, Smith-Waterman, Needleman-Wunsch, C++, Perl, R.
Place of publishing:Maribor
Publisher:[M. Matjašec]
Year of publishing:2016
PID:20.500.12556/DKUM-64442 New window
UDC:575.112(043.2)
COBISS.SI-ID:2279844 New window
NUK URN:URN:SI:UM:DK:XALWMAJ9
Publication date in DKUM:11.11.2016
Views:1327
Downloads:132
Metadata:XML DC-XML DC-RDF
Categories:FZV
:
MATJAŠEC, Matej, 2016, PRIMERJAVA UČINKOVITOSTI IMPLEMENTACIJE ALGORITMOV NEEDLEMAN-WUNSCH IN SMITH-WATERMAN ZA PORAVNAVO ZAPOREDIJ V BIOINFORMATIKI [online]. Master’s thesis. Maribor : M. Matjašec. [Accessed 14 March 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=64442
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:A COMPARISON OF IMPLEMENTATION EFFICIENCY OF NEEDLEMAN-WUNSCH AND SMITH-WATERMAN ALGORITHMS FOR SEQUENCE ALIGNMENT IN BIOINFORMATICS
Abstract:In master's thesis we were investigating and compared the effectiveness of the implementation of algorihms Needleman-Wunsch and Smith-Waterman for the comparison of sequences in the fields of bioinformatics. Based on the implementations of the same input data, we measured the time of execution in the programming language C++, Perl and statistical language R. Research methodology: Theoretical basis of the master's thesis is based on relevant publications by various authors and online resources. Results: Execution time of algorithms in C++ programming language, the shorter input data does not exceed 1ms and long input data does not exceed 15ms. In programming language Perl or statistical language R, where the execution time with input data length increases exponentially. Conclusion: Execution time of algorithms Needleman-Wunsch and Smith-Watermn on the same input data in C++ programming language is shorter than in Perl or statistical language R.
Keywords:Sequence alignment, Smith-Waterman, Needleman-Wunsch, C++, Perl, R.


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica