About: A dynamic programming algorithm for identification of triplex-forming sequences     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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. 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 satisf
  • 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. 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 satisf (en)
Title
  • A dynamic programming algorithm for identification of triplex-forming sequences
  • A dynamic programming algorithm for identification of triplex-forming sequences (en)
skos:prefLabel
  • A dynamic programming algorithm for identification of triplex-forming sequences
  • A dynamic programming algorithm for identification of triplex-forming sequences (en)
skos:notation
  • RIV/00216305:26230/11:PU96166!RIV13-GA0-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA204/08/1560), S, Z(MSM0021630528)
http://linked.open...iv/cisloPeriodika
  • 18
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 183775
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/11:PU96166
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • DNA sequence analysis, H-DNA, triplex, triplet, triad, gene regulation, pattern search, pattern recognition (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV
  • [FA38C1EDFDA6]
http://linked.open...i/riv/nazevZdroje
  • BIOINFORMATICS
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 27
http://linked.open...iv/tvurceVysledku
  • Burgetová, Ivana
  • Brázdová, Marie
  • Kopeček, Daniel
  • Lexa, Matej
  • Martínek, Tomáš
http://linked.open...ain/vavai/riv/wos
  • 000294755400006
http://linked.open...n/vavai/riv/zamer
issn
  • 1367-4803
number of pages
http://bibframe.org/vocab/doi
  • 10.1093/bioinformatics/btr439
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software