Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Author： Lin Y-L. Jiang T. Chao K-M.

Publisher： Academic Press

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.65, Iss.3, 2002-11, pp. : 570-586

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

Constrained Projection Approximation Algorithms for Principal Component Analysis

By Choi Seungjin Ahn Jong-Hoon Cichocki Andrzej

Neural Processing Letters, Vol. 24, Iss. 1, 2006-08 ,pp. : 53-65

Springer Publishing Company

Access to resources Recommend Favorite

Ultrafast clustering algorithms for metagenomic sequence analysis

By Li Weizhong Fu Limin Niu Beifang Wu Sitao Wooley John

Briefings in Bioinformatics, Vol. 13, Iss. 6, 2012-11 ,pp. : 656-668

Oxford University Press

Access to resources Recommend Favorite

An expressive framework and efficient algorithms for the analysis of collaborative tagging

By Das Mahashweta Thirumuruganathan Saravanan Amer-Yahia Sihem Das Gautam Yu Cong

The VLDB Journal, Vol. 23, Iss. 2, 2014-04 ,pp. : 201-226

Springer Publishing Company

Access to resources Recommend Favorite

Applications of genetic algorithms in process planning: tool sequence selection for 2.5-axis pocket machining

By Ahmad Zaryab Rahmani Keyvan D’Souza Roshan

Journal of Intelligent Manufacturing, Vol. 21, Iss. 4, 2010-08 ,pp. : 461-470

Springer Publishing Company

Access to resources Recommend Favorite

Computational Discretization Algorithms for Functional Inequality Constrained Optimization

By Teo K.L.

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite