Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem

One fundamental problem of bioinformatics is the computational recognition of DNA and RNA binding sites. Given a set of short DNA or RNA sequences of equal length such as transcription factor binding sites or RNA splice sites, the task is to learn a pattern from this set that allows the recognition...

Full description

Bibliographic Details
Main Authors: Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
Format: Article
Language:English
Published: MDPI AG 2015-06-01
Series:Computation
Subjects:
splice site
permuted Markov model
permuted variable length Markov model
quadratic traveling salesman problem
combinatorial optimization
dynamic programming
branch and bound
branch and cut
integer linear programming
Online Access:http://www.mdpi.com/2079-3197/3/2/285

Internet

http://www.mdpi.com/2079-3197/3/2/285

Similar Items