English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Thesis

Algorithms for efficient alignment-free sequence comparison

MPS-Authors
/persons/resource/persons56652

Domazet-Lošo,  Mirjana
Research Group Bioinformatics, Department Evolutionary Genetics, Max Planck Institute for Evolutionary Biology, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

Thesis_Mirjana Domazet-Loso.pdf
(Publisher version), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Domazet-Lošo, M. (2010). Algorithms for efficient alignment-free sequence comparison. PhD Thesis, University of Zagreb, Zagreb.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-D451-8
Abstract
Sequence comparison is an essential tool in modern biology. It is used to identify homologous regions between sequences, and to detect evolutionary relationships between organisms. Sequence comparison is usually based on alignments. However, aligning whole genomes is computationally difficult. As an alternative approach, alignment-free sequence comparison can be used. In my thesis, I concentrate on two problems that can be solved without alignment: (i) estimation of substitution rates between nucleotide sequences, and (ii) detection of local sequence homology. In the first part of my thesis, I developed and implemented a new algorithm for the efficient alignment-free computation of the number of nucleotide substitutions per site, and applied it to the analysis of large data sets of complete genomes. In the second part of my thesis, I developed and implemented a new algorithm for detecting matching regions between nucleotide sequences. I applied this solution to the classification of circulating recombinant forms of HIV, and to the analysis of bacterial genomes subject to horizontal gene transfer.