Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Algorithms for Aligning Genetic Sequences to Reference Genomes
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2017 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The technologies for sequencing genetic materials have improved vastly during the last fifteen years. Sequences can now be determined to affordable costs and therefore are more genetic sequences available than ever before. The bottleneck is no longer to obtain genetic sequences but rather to analyze all the sequence data.

A primary step in sequence analysis is to determine a sequence fragment’s position in the genome, a process called aligning. From Computing Science point of view, this is essentially text matching. This is however a much more complex task than searching for strings in ordinary text documents. First, there is large amount of data. An ordinary sequencing experiment could generate more than 100 million sequences. Each sequence should be matched to a reference genome sequence, which is some billions characters in size. Second, the obtained sequences may have differences compared to the reference genome sequence. The algorithms are thus not only searching for exact matches, but for the best approximate matches.

In this work I review the algorithms behind modern sequence alignment softwares. I also propose to evaluate to the fast Fourier transform for the task.

Place, publisher, year, edition, pages
2017. , p. 24
Series
UMNAD ; 1122
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:umu:diva-142507OAI: oai:DiVA.org:umu-142507DiVA, id: diva2:1161762
Educational program
Bachelor of Science Programme in Computing Science
Supervisors
Examiners
Available from: 2017-12-01 Created: 2017-12-01 Last updated: 2017-12-01Bibliographically approved

Open Access in DiVA

fulltext(173 kB)250 downloads
File information
File name FULLTEXT01.pdfFile size 173 kBChecksum SHA-512
5c201f2a864a1c8c31d50a3f53494da6de1541dc9934ef4c330a954f46d60eb27184bad2298a6a732680ed0a5ea48c855b3f2525842c997e8e611cac48a2b630
Type fulltextMimetype application/pdf

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 250 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 121 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf