Author： Gu Q.-P. Peng S. Sudborough H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.210, Iss.2, 1999-01, pp. : 327-339
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
(1+&unknown;)-Approximation of sorting by reversals and transpositions
By Eriksen N.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
Signed genome rearrangement by reversals and transpositions: models and approximations
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Efficient algorithms for multichromosomal genome rearrangements
By Tesler G.
Journal of Computer and System Sciences, Vol. 65, Iss. 3, 2002-11 ,pp. :
An Approximation Algorithm for Binary Searching in Trees
By Laber Eduardo Molinaro Marco
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :