A dynamic programming algorithm for identification of triplex-forming sequences | Zendy

Matej Lexa | Zendy; Tomáš Martínek | Zendy; Ivana Burgetová | Zendy; Daniel Kopeček | Zendy; Marie Brázdová | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A dynamic programming algorithm for identification of triplex-forming sequences

Author(s) -

Matej Lexa,

Tomáš Martínek,

Ivana Burgetová,

Daniel Kopeček,

Marie Brázdová

Publication year - 2011

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btr439

Subject(s) - algorithm , correctness , computer science , repressor lexa , source code , palindrome , stacking , identification (biology) , dynamic programming , sequence (biology) , theoretical computer science , genome , biology , genetics , programming language , chemistry , botany , organic chemistry , repressor , transcription factor , gene

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research