| dc.contributor.advisor |
Mitić, Nenad |
|
| dc.contributor.author |
Jelović, Ana |
|
| dc.date.accessioned |
2022-08-04T11:39:02Z |
|
| dc.date.available |
2022-08-04T11:39:02Z |
|
| dc.date.issued |
2022 |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/5442 |
|
| dc.description.abstract |
n the first part of this dissertation different repeat types are defined
as well as repeats that satisfy motif masks. A method for precise repeat finding
in input sequences of arbitrary length has been described. As the input sequences
can be very long, the number of found repeats can also be large. For that reason
it is important that the method also includes filtering found repeats based on the
expected number of their occurrences.
The method was first applied to protein sequences in which experimentally
confirmed T-cell epitopes from the IEDB database were registered. Association
rules were applied to the found repeats in order to construct a model that would
enable the prediction of the positions of T-cell epitopes in protein sequences.
In this way, it would indicate to researchers a region in the protein sequence
where an epitope can be expected with high confidence. In the case of T-cell
epitopes, a large number of rules with high confidence was found. These rules can
be considered as reliable predictors of the position of T-cell epitopes within the
protein sequences. Based on the results found, association rules were formed that
characterize the epitopes and the repeats associated with them in more detail. As
a large number of results were found, only their part is presented in this disser-
tation. On the basis of the strings that determine the repeat, a motif mask that
the repeat needs to satisfy was searched for. The entire procedure was applied to
both direct non-complementary repeats and indirect non-complementary repeats.
With similar results, the entire procedure was applied to B-cell epitopes on data
from the IEDB database.
Data on experimentally confirmed short linear motifs were taken from the ELM
database. In protein sequences where short linear motifs were registered, repeats
were searched for and association rules were applied to them. The rules with high
confidence have been singled out in particular. On the basis of the results found,
motif masks that repeats with high confidence would satisfy were searched for. |
en_US |
| dc.description.provenance |
Submitted by Slavisha Milisavljevic (slavisha) on 2022-08-04T11:39:02Z
No. of bitstreams: 1
Ana_Jelovic_tekst_doktorata.pdf: 6127093 bytes, checksum: b5d8ed0fba16d488117f3928a607f80d (MD5) |
en |
| dc.description.provenance |
Made available in DSpace on 2022-08-04T11:39:02Z (GMT). No. of bitstreams: 1
Ana_Jelovic_tekst_doktorata.pdf: 6127093 bytes, checksum: b5d8ed0fba16d488117f3928a607f80d (MD5)
Previous issue date: 2022 |
en |
| dc.language.iso |
sr |
en_US |
| dc.publisher |
Beograd |
en_US |
| dc.title |
ANALIZA ZASTUPLJENOSTI PONOVAKA SA PRIMENOM U PREDVIDJANJU T-ĆELIJSKIH EPITOPA |
en_US |
| mf.author.birth-date |
1973-07-30 |
|
| mf.author.birth-place |
Beograd |
en_US |
| mf.author.birth-country |
Srbija |
en_US |
| mf.author.residence-state |
Srbija |
en_US |
| mf.author.citizenship |
Srpsko |
en_US |
| mf.author.nationality |
Srpkinja |
en_US |
| mf.subject.area |
Computer Science |
en_US |
| mf.subject.keywords |
repeats, T-cell epitopes, short linear motifs, association rules |
en_US |
| mf.subject.subarea |
Bioinformatics, Data mining |
en_US |
| mf.contributor.committee |
Malkov, Saša |
|
| mf.contributor.committee |
Kovačević, Jovana |
|
| mf.contributor.committee |
Ognjanović, Zoran |
|
| mf.university.faculty |
Mathematical faculty |
en_US |
| mf.document.references |
35 |
en_US |
| mf.document.pages |
449 |
en_US |
| mf.document.location |
Beograd |
en_US |
| mf.document.genealogy-project |
No |
en_US |
| mf.university |
Belgrade University |
en_US |