• Je něco špatně v tomto záznamu ?

A dynamic programming algorithm for identification of triplex-forming sequences

M. Lexa, T. Martínek, I. Burgetová, D. Kopeček, M. Brázdová

. 2011 ; 27 (18) : 2510-2517. [pub] 20110726

Jazyk angličtina Země Velká Británie

Typ dokumentu časopisecké články, práce podpořená grantem

Perzistentní odkaz   https://www.medvik.cz/link/bmc12022128

MOTIVATION: Current methods for identification of potential triplex-forming sequences in genomes and similar sequence sets rely primarily on detecting homopurine and homopyrimidine tracts. Procedures capable of detecting sequences supporting imperfect, but structurally feasible intramolecular triplex structures are needed for better sequence analysis. RESULTS: We modified an algorithm for detection of approximate palindromes, so as to account for the special nature of triplex DNA structures. From available literature, we conclude that approximate triplexes tolerate two classes of errors. One, analogical to mismatches in duplex DNA, involves nucleotides in triplets that do not readily form Hoogsteen bonds. The other class involves geometrically incompatible neighboring triplets hindering proper alignment of strands for optimal hydrogen bonding and stacking. We tested the statistical properties of the algorithm, as well as its correctness when confronted with known triplex sequences. The proposed algorithm satisfactorily detects sequences with intramolecular triplex-forming potential. Its complexity is directly comparable to palindrome searching. AVAILABILITY: Our implementation of the algorithm is available at http://www.fi.muni.cz/lexa/triplex as source code and a web-based search tool. The source code compiles into a library providing searching capability to other programs, as well as into a stand-alone command-line application based on this library. CONTACT: lexa@fi.muni.cz SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Citace poskytuje Crossref.org

000      
00000naa a2200000 a 4500
001      
bmc12022128
003      
CZ-PrNML
005      
20151124100855.0
007      
ta
008      
120806s2011 xxk f 000 0#eng||
009      
AR
024    7_
$a 10.1093/bioinformatics/btr439 $2 doi
035    __
$a (PubMed)21791534
040    __
$a ABA008 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxk
100    1_
$a Lexa, Matej, $d 1966- $7 xx0063347 $u Department of Information Technology, Faculty of Informatics, Masaryk University, 60200 Brno, Czech Republic
245    12
$a A dynamic programming algorithm for identification of triplex-forming sequences / $c M. Lexa, T. Martínek, I. Burgetová, D. Kopeček, M. Brázdová
520    9_
$a MOTIVATION: Current methods for identification of potential triplex-forming sequences in genomes and similar sequence sets rely primarily on detecting homopurine and homopyrimidine tracts. Procedures capable of detecting sequences supporting imperfect, but structurally feasible intramolecular triplex structures are needed for better sequence analysis. RESULTS: We modified an algorithm for detection of approximate palindromes, so as to account for the special nature of triplex DNA structures. From available literature, we conclude that approximate triplexes tolerate two classes of errors. One, analogical to mismatches in duplex DNA, involves nucleotides in triplets that do not readily form Hoogsteen bonds. The other class involves geometrically incompatible neighboring triplets hindering proper alignment of strands for optimal hydrogen bonding and stacking. We tested the statistical properties of the algorithm, as well as its correctness when confronted with known triplex sequences. The proposed algorithm satisfactorily detects sequences with intramolecular triplex-forming potential. Its complexity is directly comparable to palindrome searching. AVAILABILITY: Our implementation of the algorithm is available at http://www.fi.muni.cz/lexa/triplex as source code and a web-based search tool. The source code compiles into a library providing searching capability to other programs, as well as into a stand-alone command-line application based on this library. CONTACT: lexa@fi.muni.cz SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
650    _2
$a algoritmy $7 D000465
650    _2
$a chybné párování bází $7 D020137
650    _2
$a sekvence nukleotidů $7 D001483
650    _2
$a DNA $x chemie $x metabolismus $7 D004247
650    _2
$a Escherichia coli K12 $x genetika $7 D048168
650    _2
$a genom $7 D016678
650    _2
$a lidé $7 D006801
650    _2
$a obrácené repetice $7 D055029
650    _2
$a pravděpodobnostní funkce $7 D016013
650    _2
$a konformace nukleové kyseliny $7 D009690
650    _2
$a sekvenční analýza DNA $x metody $7 D017422
655    _2
$a časopisecké články $7 D016428
655    _2
$a práce podpořená grantem $7 D013485
700    1_
$a Martínek, Tomáš $u Department of Computer Systems, Faculty of Information Technology, Brno Technical University, 61266 Brno, Czech Republic
700    1_
$a Burgetová, Ivana $u Department of Computer Systems, Faculty of Information Technology, Brno Technical University, 61266 Brno, Czech Republic
700    1_
$a Kopeček, Daniel $u Department of Information Technology, Faculty of Informatics, Masaryk University, 60200 Brno, Czech Republic
700    1_
$a Brázdová, Marie $7 xx0100610 $u Department of Biophysical Chemistry and Molecular Oncology, Institute of Biophysics, Academy of Sciences of the Czech Republic v.v.i., CZ-61265 Brno, Czech Republic
773    0_
$w MED00008115 $t Bioinformatics (Oxford, England) $x 1367-4811 $g Roč. 27, č. 18 (2011), s. 2510-2517
856    41
$u https://pubmed.ncbi.nlm.nih.gov/21791534 $y Pubmed
910    __
$a ABA008 $b sig $c sign $y m $z 0
990    __
$a 20120806 $b ABA008
991    __
$a 20151124100923 $b ABA008
999    __
$a ok $b bmc $g 944041 $s 779425
BAS    __
$a 3
BAS    __
$a PreBMC
BMC    __
$a 2011 $b 27 $c 18 $d 2510-2517 $e 20110726 $i 1367-4811 $m Bioinformatics $n Bioinformatics $x MED00008115
LZP    __
$b NLK111 $a Pubmed-20120806/12/01

Najít záznam

Citační ukazatele

Možnosti archivace