Detailed Information
Cited 21 time in 
Cited 22 time in 
Cited 22 time in
Metadata Downloads
Linear-time algorithm for finding a maximum-density segment of a sequence
- Authors
- Kim, SK
- Issue Date
- Jun-2003
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- algorithms; bioinformatics
- Citation
- INFORMATION PROCESSING LETTERS, v.86, no.6, pp 339 - 342
- Pages
- 4
- Journal Title
- INFORMATION PROCESSING LETTERS
- Volume
- 86
- Number
- 6
- Start Page
- 339
- End Page
- 342
- ISSN
- 0020-0190
- Abstract
- The linear-time algorithm for finding a maximum-density segment of a sequence was presented. The maximum density segment problem was transformed into a geometric one. It was shown that the transformed problem can be solved in O(n) time by geometric algorithms.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.