Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A simple and compact algorithm for the RMQ and its application to the longest common repeat problem
- Authors
- Lee, I.; Song, H.Y.
- Issue Date
- 2007
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4431 LNCS, no.PART 1, pp.554 - 561
- Volume
- 4431 LNCS
- Number
- PART 1
- Start Page
- 554
- End Page
- 561
- ISSN
- 0302-9743
- Abstract
- The Range Minimum Query (RMQ) problem is to find the smallest element in an array for given range {a, b). We propose a simple and compact algorithm for this problem when the queries are sorted in ascending order. Then we show how to use this algorithm for the generalised longest common repeat problem [14]. Our algorithm is easy to understand and implement and requires much smaller memory. © Springer-Verlag Berlin Heidelberg 2007.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering > Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Song, Ha Yoon
- Engineering (Department of Computer Engineering)