Period of time： 2003年3期
Publisher： Academic Press
Founded in： 1967
Total resources： 17
ISSN： 0022-0000
Subject： TP Automation Technology , Computer Technology
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Computer and System Sciences,volume 65,issue 3
Menu
By Li M.,Pevzner P.,Shamir R. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.
Access to resources
Recommend
The longest common subsequence problem for sequences with nested arc annotations
By Lin G.,Chen Z-Z.,Jiang T.,Wen J. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.Methods for reconstructing the history of tandem repeats and their application to the human genome
By Jaitly D.,Kearney P.,Lin G.,Ma B. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.Steps toward accurate reconstructions of phylogenies from gene-order data
By Moret B.M.E.,Tang J.,Wang L-S.,Warnow T. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.The restriction mapping problem revisited
By Pandurangan G.,Ramesh H. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.The consensus string problem and the complexity of comparing hidden Markov models
By Lyngsø R.B.,Pedersen C.N.S. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.By Lin Y-L.,Jiang T.,Chao K-M. in (2002)
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.Efficient algorithms for multichromosomal genome rearrangements
Journal of Computer and System Sciences,volume 65,issue 3 , Vol. 65, Iss. 3, 2002-11 , pp.
Previous
Next