Optimal algorithms for uncovering synteny problem

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.12, Iss.4, 2006-12, pp. : 421-432

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

Optimal algorithms for recombination distance problem

By He Yong Chen Ting

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 647-655

Taylor & Francis Ltd

Access to resources Recommend Favorite

The State Reduction and Related Algorithms and Their Applications to the Study of Markov Chains, Graph Theory, and the Optimal Stopping Problem

By Sonin I.

Advances in Mathematics, Vol. 145, Iss. 2, 1999-08 ,pp. : 159-188

Academic Press

Access to resources Recommend Favorite

Optimal Security Liquidation Algorithms

By Butenko Sergiy Golodnikov Alexander Uryasev Stanislav

Computational Optimization and Applications, Vol. 32, Iss. 1-2, 2005-10 ,pp. : 9-27

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Constructions of Hybrid Algorithms

By Kao M-Y. Ma Y. Sipser M. Yin Y.

Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. : 142-164

Academic Press

Access to resources Recommend Favorite

Optimal Sequencing of Contract Algorithms

By Zilberstein S.

Annals of Mathematics and Artificial Intelligence, Vol. 39, Iss. 1-2, 2003-09 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite