Try new release: COBISS+
 Shared database: COBIB.SI - Union bibliographic/catalogue database (No. of records: 4.952.621)

Selected record permalink

AuthorMurovec, Boštjan
Stres, Blaž
Title Učinkovito kodiranje zaporedij DNA = Efficient coding of DNA / Boštjan Murovec in Blaž Stres
Type/contenttype of material article - component part
LanguageSlovenian
Publication date2008
Physical descriptionstr. 151-162
NotesIzvleček ; Abstract
Bibliografija: str. 162
Uncontrolled subject headingsmolekulkarna genetika / bioinformatika DNK / kodiranje zaporedij / molecular genetics / bioinformatics / DNA sequences / coding
UDC575
URLhttp://www.dlib.si/details/URN:NBN:SI:doc-7WWR7RSM
URNURN:NBN:SI:doc-7WWR7RSM
SummaryV zadnjem obdobju smo priča znatnemu naraščanju uporabe mikroračunalnikov pri raziskavah in analizah zaporedij DNA. Molekule DNA so računalnikom najpogosteje predstavljene v obliki zapisov v formatu FASTA , ki kodirajo sekvence DNA v obliki ASCII niza štirih nukleotidnih oznak A, G, C in T, katerim se po potrebi pridružijo še degenerativne kode in znak za presledek, ko gre za množice med seboj poravnanih zaporedij DNA. Zapis FASTA je dojemljiv za biologa in enostaven za programerja, ki razvija računalniški program, saj si pri razvoju lahko pomaga z bogatim naborom obstoječih knjinic za delo z znakovnimi polji. Kljub omenjenim prednostim ima zapis FASTA določene slabosti, kot je manj učinkovito iskanje zaporedij nukleotidov, še posebej ob prisotnosti degenerativnih kod. Druga slabost izvira iz dejstva, da vsak posamezni znak FASTA za presledek zasede po en zlog računalniškega pomnilnika,kar je ob prisotnosti velikega števila presledkov neučinkovito in tudi dodatno manjša hitrost iskanja nukleotidnih zaporedij. Zaradi omenjenih slabosti predstavljamo alternativni zapis zaporedij DNA, ki omogoča hitrejše iskanje nukleotidnih zaporedij in učinkovitejše shranjevanje informacij o poravnavi, kar vodi v hitrejše delovanje programov in odpira monost shranjevanja večjega števila zapisov DNA v delovni pomnilnik računalnika.
Microcomputers have become ubiquitous tools for DNA research and analysis. Before DNA sequences can be fed into computer programs they need to be suitably coded, which is usually done in a widely accepted FASTA format. According to this scheme, DNA sequence is represented as an ASCII string of four nucleotide characters A, G, C and T, possibly extended with additional codes for representation of degenerated sites, and a character code for FASTA blanks when dealing with aligned DNA sequences. FASTA representation is intuitive for biologists and it eases development of programs since developer scan utilize a myriad of available libraries for working with ASCII strings. Despite the mentioned advantages, FASTA format possesses certain drawbacks like inefficient searching for substrings, especially in the presence of degenerative codes. The second disadvantage is inefficient storage of FASTA blank characters, since each such character occupies one byte of memory. Substring searching speed is also negatively affected in the case of excessive number of blanks. Due to the stated drawbacks, we propose an alternative coding of DNA sequences, which enables faster searching of substrings and efficient storage of FASTA blanks, with the result that a greater set of DNA sequences can be held in working memory of a computer and processed faster.
COBISS.SI-ID2412168
See publication: TI=Acta agriculturae Slovenica ISSN: 1581-9175.- Letn. 92, št. 2 (2008), str. 151-162

info Electronic version of document accessible or this is electronic resource