Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence

Theoretical Computer Science

Volumn 407, Issue 1-3, 2008, Pages 349-358

  Liu, Hsiao Fei ^a   Chao, Kun Mao ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Maximum sum segment; Sequence analysis

Indexed keywords

CONTROL THEORY; FUNCTION EVALUATION;

COMPUTATION TREE; LOWER BOUNDS; MAXIMUM-SUM SEGMENT; NEW RESULTS; PATHS PROBLEM; POSITIVE INTEGERS; SEQUENCE ANALYSIS; WEIGHT FUNCTIONS;

TREES (MATHEMATICS);

EID: 53249153467     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.06.052     Document Type: Article

References (36)

1. Allison L. Longest biased interval and longest non-negative sum interval. Bioinformatics 19 10 (2003) 1294-1295
2. Sung Eun Bae, Tadao Takaoka, Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem, in: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004, pp. 247-253
3. Sung Eun Bae, Tadao Takaoka, Improved algorithms for the k-maximum subarray problem for small k, in: Proceedings of the 11th Annual International Computing and Combinatorics Conference, 2005, pp. 621-631
4. Sung Eun Bae, Tadao Takaoka, A sub-cubic time algorithm for the k-maximum subarray problem, in: Proceedings of the 18th Annual International Symposium on Algorithms and Computation, 2007, pp. 751-762
5. Michale A. Bender, Martin Farach-Colton, The LCA problem revisited, in: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, 2000, pp. 88-94
6. Fredrik Bengtsson, Jingsen Chen, Efficient algorithms for k maximum sums, in: Proceedings of the 15th Annual International Symposium on Algorithms and Computation, 2004, pp. 137-148
7. Bentley J. Programming pearls: Algorithm design techniques. Communications of the ACM (1984) 865-871
8. Michael Ben-Or, Lower bounds for algebraic computation trees, in: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 80-86
9. Gerth S. Brodal, Allan G. Jørgensen, A linear time algorithm for the k maximal sums problem, in: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, 2007, pp. 442-453
10. Chen K.-Y., and Chao K.-M. On the range maximum-sum segment query problem. Discrete Applied Mathematics 155 16 (2007) 2043-2052
11. Chen K.-Y., and Chao K.-M. Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. Information Processing Letters 96 6 (2005) 197-201
12. Cheng C.-H., Chen K.-Y., Tien W.-C., and Chao K.-M. Improved algorithms for the k maximum-sums problems. Theoretical Computer Science 362 13 (2006) 162-170
13. Chung K.-M., and Lu H.-I. An optimal algorithm for the maximum-density segment problem. SIAM Journal on Computing 34 2 (2004) 373-387
14. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), The MIT Press
15. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing 28 2 (1998) 652-673
16. Tsai-Hung Fan, Shufen Lee, Hsueh-I Lu, Tsung-Shan Tsou, Tsai-Cheng Wang, Adam Yao, An optimal algorithm for maximum-sum segment and its application in bioinformatics extended abstract, in: Proceeding of the 8th International Conference on Implementation and Application of Automata, 2003, pp. 251-257
17. Frederickson G.N. An optimal algorithm for selection in a min-heap. Information and Computation 104 2 (1993) 197-214
18. Johannes Fischer, Volker Heun, Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE, in: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, 2006, pp. 36-48
19. Frederickson G.N., and Johnson D.B. The complexity of selection and ranking in X + Y and matrices with sorted rows and columns. Journal of Computer and System Science 24 2 (1982) 197-208
20. Frederickson G.N., and Johnson D.B. Finding kth paths and p-centers by generating and searching good data structures. Journal of Algorithms 4 1 (1983) 61-80
21. Fukuda T., Morimoto Y., Morishita S., and Tokuyama T. Data mining with optimized two-dimensional association rules. ACM Transactions on Database Systems 26 2 (2001) 179-213
22. Grenander U. Pattern Analysis (1978), Springer-Verlag, New York
23. Goldwasser M., Kao M.-Y., and Lu H.-I. Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. Journal of Computer and System Sciences 70 2 (2005) 128-144
24. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13 2 (1984) 338-355
25. Huang X. An algorithm for identifying regions of a DNA sequence that satisfy a content requirement. Computer Applications in the Biosciences 10 (1994) 219-225
26. Kim S.K. Linear-time algorithm for finding a maximum-density segment of a sequence. Information Processing Letters 86 6 (2003) 339-342
27. Kim S.K. Finding a longest nonnegative path in a constant degree tree. Information Processing Letters 93 6 (2003) 275-279
28. Lin Y.-L., Huang X., Jiang T., and Chao K.-M. MAVG: Locating non-overlapping maximum average segments in a given sequence. Bioinformatics 19 1 (2003) 151-152
29. Lin Y.-L., Jiang T., and Chao K.-M. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. Journal of Computer and System Sciences 65 3 (2002) 570-586
30. Tien-Ching Lin, D.T. Lee, Randomized algorithm for the sum selection problem, in: Proceedings of the 16th Annual International Symposium on Algorithms and Computation, 2005, pp. 515-523
31. Tien-Ching Lin, D.T. Lee, Efficient algorithm for the sum selection problem and k maximum sums problem, in: Proceedings of the 17th Annual International Symposium on Algorithms and Computation, 2006, pp. 460-473
32. 2 n) algorithm for the kth longest path in a tree with applications to location problems. SIAM Journal on Computing 10 2 (1981) 328-337
33. Perumalla K., and Deo N. Parallel algorithms for maximum subsequence and maximum subarray. Parallel Processing Letters 5 (1995) 367-373
34. Wang L., and Xu Y. SEGID: Identifying interesting segments in (multiple) sequence alignments. Bioinformatics 19 2 (2003) 297-298
35. Wu B.Y., Chao K.-M., and Tang C.Y. An efficient algorithm for the length-constrained heaviest path problem on a tree. Information Processing Letters 69 2 (1999) 63-67
36. Wu B.Y., and Chao K.-M. Spanning Trees and Optimization Problems. first ed. (2004), Chapman & Hall/CRC