On the range maximum-sum segment query problem

Discrete Applied Mathematics

Volumn 155, Issue 16, 2007, Pages 2043-2052

  Chen, Kuan Yu ^a   Chao, Kun Mao ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Least common ancestor; Maximum sum segment; Range minimum query

Indexed keywords

MATHEMATICAL MODELS; NUMBER THEORY; PROBLEM SOLVING;

LEAST COMMON ANCESTOR; MAXIMUM-SUM SEGMENT; RANGE MINIMUM QUERY;

QUERY LANGUAGES;

EID: 34547787604     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.05.018     Document Type: Article

References (18)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, Reading, MA
2. Allison L. Longest biased interval and longest non-negative sum interval. Bioinformatics 19 (2003) 1294-1295
3. Alstrup S., Gavoille C., Kaplan H., and Rauhe T. Nearest common ancestors: a survey and a new algorithm for a distributed environment. Theory Comput. Syst. 37 (2004) 441-456
4. Bender M.A., Farach-Colton M., Pemmasani G., Skiena S., and Sumazin P. Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57 (2005) 75-94
5. J. Bentley, Programming pearls-algorithm design techniques, CACM, 1984, pp. 865-871.
6. Chen K.-Y., and Chao K.-M. Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. Inform. Process. Lett. 96 (2005) 197-201
7. Chung K., and Lu H.-I. An optimal algorithm for the maximum-density segment problem. SIAM J. Comput. 34 2 (2004) 373-387
8. T.-H. Fan, S. Lee, H.-I Lu, T.-S. Tsou, T.-C. Wang, A. Yao, An optimal algorithm for maximum-sum segment and its application in bioinformatics, CIAA, Lecture Notes in Computer Science, vol. 2759, Springer, Berlin, 2003, pp. 251-257.
9. H. Gabow, J. Bentley, R. Tarjan, Scaling and related techniques for geometry problems, STOC 1984, pp. 135-143.
10. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1999), Cambridge University Press, Cambridge
11. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13 (1984) 338-355
12. X. Huang, An algorithm for identifying regions of a DNA sequence that satisfy a content requirement, CABIOS vol. 10, 1994, pp. 219-225.
13. Lin Y.-L., Huang X., Jiang T., and Chao K.-M. MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinformatics 19 (2003) 151-152
14. Lin Y.-L., Jiang T., and Chao K.-M. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. System Sci. 65 (2002) 570-586
15. W.L. Ruzzo, M. Tompa, A linear time algorithm for finding all maximal scoring subsequences, in: Seventh International Conference on Intelligent Systems for Molecular Biology, Heidelberg, Germany, 1999, pp. 234-241.
16. Schieber B., and Vishkin U. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17 (1988) 1253-1262
17. J. Vuillemin, A unifying look at data structures, CACM, vol. 23, 1980, pp. 229-239.
18. Wang L., and Xu Y. SEGID: identifying interesting segments in (multiple) sequence alignments. Bioinformatics 19 (2003) 297-298