An improved algorithm for finding a length-constrained maximum-density subtree in a tree

Given a tree T with weight and length on each edge, as well as a lower bound L and an upper bound U, the so-called length-constrained maximum-density subtree problem is to find a maximum-density subtree in T such that the length of this subtree is between L and U. In this study, we present an algorithm that runs in O(nUlogn) time for the case when the edge lengths are positive integers, where n is the number of nodes in T, which is an improvement over the previous algorithms when U=@W(logn). In addition, we show that the time complexity of our algorithm can be reduced to O(nLlognL), when the edge lengths being considered are uniform.

[1]  Ming-Yang Kao,et al.  Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics , 2002, WABI.

[2]  Hoong Chuin Lau,et al.  Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics , 2006, Discret. Optim..

[3]  Sun-Yuan Hsieh,et al.  Finding a Weight-Constrained Maximum-Density Subtree in a Tree , 2005, ISAAC.

[4]  Ming-Yang Kao,et al.  Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications , 2002, J. Comput. Syst. Sci..

[5]  Hsueh-I Lu,et al.  An Optimal Algorithm for the Maximum-Density Segment Problem , 2003, SIAM J. Comput..

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  X. Huang,et al.  An algorithm for identifying regions of a DNA sequence that satisfy a content requirement , 1994, Comput. Appl. Biosci..

[8]  Kun-Mao Chao,et al.  Finding a Length-Constrained Maximum-Density Path in a Tree , 2005, J. Comb. Optim..

[9]  Chuan Yi Tang,et al.  An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree , 1999, Inf. Process. Lett..

[10]  Sung Kwon Kim,et al.  Linear-time algorithm for finding a maximum-density segment of a sequence , 2003, Inf. Process. Lett..

[11]  Sun-Yuan Hsieh,et al.  Finding a maximum-density path in a tree under the weight and length constraints , 2008, Inf. Process. Lett..

[12]  Yaw-Ling Lin,et al.  Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis , 2002, J. Comput. Syst. Sci..