Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci., 65(3):570-586, 2002. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence AnalysisYaw-Ling Lin, Tao Jiang, Kun-Mao Chao. mfcs 2002: 459-470 [doi] An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a TreeBang Ye Wu, Kun-Mao Chao, Chuan Yi Tang. ipl, 69(2):63-67, 1999. [doi] Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data AnalysisHsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao. isaac 2007: 834-845 [doi]
The following publications are possibly variants of this publication: