Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa

Jatkuvasti kasvava biologisen datan määrä asettaa uusia vaatimuksia biosekvenssien rinnastusalgoritmeille bioinformatiikan alalla. Tässä kandidaatintutkielmassa on aihetta käsittelevän lähdekirjallisuuden avulla kartoitettu bioinformatiikan ja molekyylibiologisten tietokantojen nykytilannetta, ja ta...

Full description

Bibliographic Details
Main Author: Riikonen, Juha
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Format: Bachelor's thesis
Language:fin
Published: 2019
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/64387
_version_ 1828193211225473025
author Riikonen, Juha
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Riikonen, Juha Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Riikonen, Juha Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Riikonen, Juha
datasource_str_mv jyx
description Jatkuvasti kasvava biologisen datan määrä asettaa uusia vaatimuksia biosekvenssien rinnastusalgoritmeille bioinformatiikan alalla. Tässä kandidaatintutkielmassa on aihetta käsittelevän lähdekirjallisuuden avulla kartoitettu bioinformatiikan ja molekyylibiologisten tietokantojen nykytilannetta, ja tarkasteltu biosekvenssien rinnastuksessa käytetyn Needleman–Wunsch-algoritmin toimintaa ja tehokkuutta.Aikoinaan uraauurtava Needleman– Wunsch-algoritmi vaatii kuitenkin kohtuuttoman paljon laskenta-aikaa suurissa tietokantahauissa, joita mielekäs biologisen datan käsittely nykypäivänä vaatii. Tässä kohtaa kuvioihin astuvat tulosten optimaalisuudessa joustavat heuristiset rinnastusalgoritmit, joiden avulla usean pitkänkin sekvenssin samanaikainen rinnastus on mahdollista kohtuullisessa ajassa. The constantly increasing amount of biological data is setting new standards for the efficiency of biosequence alignment algorithms in the field of bioinformatics. In this literature review we survey the current state of bioinformatics and biological databases, and focus on the Needleman–Wunsch algorithm used in biosequence alignment. However, the once groundbreaking algorithm proves to be too time consuming in performing large database queries, which are required to efficiently utilize the data in existing biological databases. This is where heuristic alignment algorithms step in, which are able to align multple long sequences simultaneously in a reasonble time at the cost of specificity.
first_indexed 2019-09-20T09:14:10Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "M\u00f6nk\u00f6l\u00e4, Sanna", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Riikonen, Juha", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2019-06-05T12:59:04Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2019-06-05T12:59:04Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2019", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/64387", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Jatkuvasti kasvava biologisen datan m\u00e4\u00e4r\u00e4 asettaa uusia vaatimuksia biosekvenssien rinnastusalgoritmeille bioinformatiikan alalla. T\u00e4ss\u00e4 kandidaatintutkielmassa on aihetta k\u00e4sittelev\u00e4n l\u00e4hdekirjallisuuden avulla kartoitettu bioinformatiikan ja molekyylibiologisten tietokantojen nykytilannetta, ja tarkasteltu biosekvenssien rinnastuksessa k\u00e4ytetyn Needleman\u2013Wunsch-algoritmin toimintaa ja tehokkuutta.Aikoinaan uraauurtava Needleman\u2013 Wunsch-algoritmi vaatii kuitenkin kohtuuttoman paljon laskenta-aikaa suurissa tietokantahauissa, joita mielek\u00e4s biologisen datan k\u00e4sittely nykyp\u00e4iv\u00e4n\u00e4 vaatii. T\u00e4ss\u00e4 kohtaa kuvioihin astuvat tulosten optimaalisuudessa joustavat heuristiset rinnastusalgoritmit, joiden avulla usean pitk\u00e4nkin sekvenssin samanaikainen rinnastus on mahdollista kohtuullisessa ajassa.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "The constantly increasing amount of biological data is setting new standards for the ef\ufb01ciency of biosequence alignment algorithms in the \ufb01eld of bioinformatics. In this literature review we survey the current state of bioinformatics and biological databases, and focus on the Needleman\u2013Wunsch algorithm used in biosequence alignment. However, the once groundbreaking algorithm proves to be too time consuming in performing large database queries, which are required to ef\ufb01ciently utilize the data in existing biological databases. This is where heuristic alignment algorithms step in, which are able to align multple long sequences simultaneously in a reasonble time at the cost of speci\ufb01city.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Paivi Vuorio (paelvuor@jyu.fi) on 2019-06-05T12:59:04Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2019-06-05T12:59:04Z (GMT). No. of bitstreams: 0\n Previous issue date: 2019", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "26", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "biosekvenssien rinnastaminen", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Needleman\u2013Wunsch-algoritmi biosekvenssien rinnastuksessa", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-201906053002", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.subject.yso", "value": "algoritmit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "bioinformatiikka", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "tietokannat", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_64387
language fin
last_indexed 2025-03-31T20:02:06Z
main_date 2019-01-01T00:00:00Z
main_date_str 2019
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/740883dd-c8f3-4e10-89d0-d5ee9c3f9d82\/download","text":"URN:NBN:fi:jyu-201906053002.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2019
record_format qdc
source_str_mv jyx
spellingShingle Riikonen, Juha Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa biosekvenssien rinnastaminen Tietotekniikka Mathematical Information Technology 602 algoritmit bioinformatiikka tietokannat
title Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa
title_full Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa
title_fullStr Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa
title_full_unstemmed Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa
title_short Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa
title_sort needleman wunsch algoritmi biosekvenssien rinnastuksessa
title_txtP Needleman–Wunsch-algoritmi biosekvenssien rinnastuksessa
topic biosekvenssien rinnastaminen Tietotekniikka Mathematical Information Technology 602 algoritmit bioinformatiikka tietokannat
topic_facet 602 Mathematical Information Technology Tietotekniikka algoritmit bioinformatiikka biosekvenssien rinnastaminen tietokannat
url https://jyx.jyu.fi/handle/123456789/64387 http://www.urn.fi/URN:NBN:fi:jyu-201906053002
work_keys_str_mv AT riikonenjuha needlemanwunschalgoritmibiosekvenssienrinnastuksessa