Please use this identifier to cite or link to this item:
http://univ-bejaia.dz/dspace/123456789/19010
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kamel, Mohamed | - |
dc.contributor.author | Tari, Abdelkamel ; directeur de thèse | - |
dc.date.accessioned | 2022-05-26T10:27:16Z | - |
dc.date.available | 2022-05-26T10:27:16Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/19010 | - |
dc.description | Option : Cloud Computing | en_US |
dc.description.abstract | hort tandem repeats and homorepeats are considered as low complexity regions (LCRs) which have special properties that are very differen tfro mthos eo fglobula rproteins .Th erule stha tdefi neseconda rystructure elements do not apply when the distribution of amino acids becomes biased. While there is a tendency towards structural disorder in LCRs, various examples, and particularly homorepeats of single amino acids, suggest that very short repeats could adopt structures very difficu lt topredict. For these reasons, we have developed an algorithm to quickly analyze local repeatability along protein sequences, that is, how close a protein fragment is from a perfect repeat. Our method (REpeatability Scanner, RES, accessible at http://cbdm-01.zdv.uni-mainz.de/~munoz/res/) allows to fin dregion swit happroximat eshor trepeat si nprotei nsequences ,an dhelp st ocharacteriz eth evariable use of LCRs and compositional bias. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Université Abderrahmane Mira- Bejaia | en_US |
dc.subject | Amino acid short tandem repeats : Low complexity regions : Computational detection of sequence repeats :Homorepeats : Repeatability | en_US |
dc.title | Contribution to Bioinformatics search algorithms. | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | Thèses de Doctorat |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.