Journal article
Simple Linear Comparison of Strings in V-order*
Fundamenta Informaticae, Vol.139(2), pp.115-126
2015
Abstract
In this paper we focus on a total (but non-lexicographic) ordering of strings called V-order. We devise a new linear-time algorithm for computing the V-comparison of two finite strings. In comparison with the previous algorithm in the literature, our algorithm is both conceptually simpler, based on recording letter positions in increasing order, and more straightforward to implement, requiring only linked lists.
Details
- Title
- Simple Linear Comparison of Strings in V-order*
- Authors/Creators
- A. Alatabbi (Author/Creator) - King's College LondonJ.W. Daykin (Author/Creator) - Royal Holloway University of LondonM.S. Rahman (Author/Creator) - Bangladesh University of Engineering and TechnologyW.F. Smyth (Author/Creator) - Algorithms Research Group, Dept. of Computing & Software, McMaster University, Canada School of Engineering & Information Technology, Murdoch University, Australia
- Publication Details
- Fundamenta Informaticae, Vol.139(2), pp.115-126
- Publisher
- IOS Press
- Identifiers
- 991005544987607891
- Murdoch Affiliation
- School of Engineering and Information Technology
- Language
- English
- Resource Type
- Journal article
Metrics
36 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Citation topics
- 4 Electrical Engineering, Electronics & Computer Science
- 4.182 Data Structures, Algorithms & Complexity
- 4.182.1103 Efficient Algorithms
- Web Of Science research areas
- Computer Science, Software Engineering
- Mathematics, Applied
- ESI research areas
- Computer Science