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

Author： Fischer Anja   Fischer Frank   Jäger Gerold   Keilwagen Jens   Molitor Paul   Grosse Ivo  

Publisher： MDPI

E-ISSN： 2079-3197|3|2|285-298

ISSN： 2079-3197

Source： Computation, Vol.3, Iss.2, 2015-06, pp. : 285-298

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem

By Xu Shuhui   Wang Yong   Huang Aiqin  

Algorithms, Vol. 7, Iss. 2, 2014-05 ,pp. : 229-242

MDPI

Access to resources Recommend Favorite

Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach

By Isaacs Jason T.   Hespanha João P.  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 84-99

MDPI

Access to resources Recommend Favorite

Exact Algorithms for Maximum Clique: A Computational Study

By Prosser Patrick  

Algorithms, Vol. 5, Iss. 4, 2012-11 ,pp. : 545-587

MDPI

Access to resources Recommend Favorite

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem

By Zia Mohammed   Cakir Ziyadin   Seker Dursun Zafer  

ISPRS International Journal of Geo-Information, Vol. 7, Iss. 3, 2018-03 ,pp. : 115-115

MDPI

Access to resources Recommend Favorite

Special Issue on Computational Intelligence and Nature-Inspired Algorithms for Real-World Data Analytics and Pattern Recognition

By Cagnoni Stefano   Castelli Mauro  

Algorithms, Vol. 11, Iss. 3, 2018-02 ,pp. : 25-25

MDPI

Access to resources Recommend Favorite