On the range maximum-sum segment query problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 294-305

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

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Maximum sum interval; RMQ; Sequence analysis

Indexed keywords

J AND K; LINEAR TIME; MAXIMUM-SUM INTERVAL; PREPROCESSING TIME; REAL NUMBER; RMQ; SEQUENCE ANALYSIS; UNIT-COST RAM MODEL;

PROBLEM SOLVING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 27644560999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_27     Document Type: Article

References (14)

1. M. A. Bender, and M. Farach-Colton. The LCA Problem Revisited. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics, 17: 88-94, 2000.
2. J. Bentley. Programming Pearls - Algorithm Design Techniques, CACM, 865-871, 1984.
3. K. Chung and H.-I. Lu. An Optimal Algorithm for the Maximum-Density Segment Problem. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA 2003), LNCS 2832, 136-147, 2003.
4. T.-H. Fan ,S. Lee, H.-I Lu, T.-S. Tsou, T.-C. Wang, and A. Yao. An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics. CIAA, LNCS 2759, 251-257, 2003.
5. H. Gabow, J. Bentley, and R. Tarjan. Scaling and Related Techniques for Geometry Problems. Proc. Symp Theory of Computing(STOC), 135-143, 1984.
6. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1999.
7. D. Harel and R. E. Tarjan. Fast Algorithms for Finding Nearest Common Ancestors. SIAM J Comput., 13: 338-355, 1984.
8. X. Huang. An Algorithm for Identifying Regions of a DNA Sequence that Satisfy a Content Requirement. CABIOS, 10: 219-225, 1994.
9. Y.-L. Lin, X. Huang, T. Jiang, and K.-M. Chao, MAVG: Locating Non-Overlapping Maximum Average Segments in a Given Sequence, Bioinformatics, 19:151-152, 2003.
10. Y.-L. Lin, T. Jiang, and K.-M. Chao. Efficient Algorithms for Locating the Length-constrained Heaviest Segments with Applications to Biomolecular Sequence Analysis. Journal of Computer and System Sciences, 65: 570-586, 2002.
11. W. L. Ruzzo and M. Tompa. A Linear Time Algorithm for Finding All Maximal Scoring Subsequences. In 7th Intl. Conf. Intelligent Systems for Molecular Biology, Heidelberg, Germany, 234-241, 1999.
12. B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J Comput., 17: 1253-1262, 1988.
13. J. Vuillemin. A Unifying Look at Data Structures. CACM, 23: 229-239, 1980.
14. L. Wang and Y. Xu. SEGID: Identifying Interesting Segments in (Multiple) Sequence Alignments. Bioinformatics, 19: 297-298, 2003.