Find out how to access preview-only content
Volume 3669 of the series Lecture Notes in Computer Science pp 226-237
Optimal Integer Alphabetic Trees in Linear Time
- T. C. HuAffiliated withDepartment of Computer Science and Engineering, University of California
- , Lawrence L. LarmoreAffiliated withDepartment of Computer Science, University of Nevada
- , J. David MorgenthalerAffiliated withApplied Biosystems
Abstract
We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear time. We describe a [6] hybrid algorithm that combines the bottom-up approach of the original Hu-Tucker algorithm with the top-down approach of Larmore and Przytycka’s Cartesian tree algorithms. The hybrid algorithm demonstrates the computational equivalence of sorting and level tree construction.
- Title
- Optimal Integer Alphabetic Trees in Linear Time
- Book Title
- Algorithms – ESA 2005
- Book Subtitle
- 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings
- Pages
- pp 226-237
- Copyright
- 2005
- DOI
- 10.1007/11561071_22
- Print ISBN
- 978-3-540-29118-3
- Online ISBN
- 978-3-540-31951-1
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 3669
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Gerth Stølting Brodal (16)
- Stefano Leonardi (17)
- Editor Affiliations
-
- 16. BRICS, MADALGO, Department of Computer Science, University of Aarhus
- 17. University of Rome “La Sapienza”
- Authors
-
- T. C. Hu (18)
- Lawrence L. Larmore (19)
- J. David Morgenthaler (20)
- Author Affiliations
-
- 18. Department of Computer Science and Engineering, University of California, San Diego, CA, 92093, USA
- 19. Department of Computer Science, University of Nevada, Las Vegas, NV, 89154, USA
- 20. Applied Biosystems, Foster City, CA, 94404, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.