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.
Original language | English |
---|---|
Title of host publication | Algorithms and Computation |
Subtitle of host publication | 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings |
Editors | Sudebkumar Prasant Pal, Kunihiko Sadakane |
Publisher | Springer Nature |
Pages | 80-89 |
Number of pages | 10 |
ISBN (Electronic) | 978-3-319-04657-0 |
ISBN (Print) | 978-3-319-04656-3 |
DOIs | |
Publication status | Published - 03 Feb 2014 |
Externally published | Yes |
Event | Proceedings 8th International Workshop, WALCOM 2014 - Chennai, India Duration: 13 Feb 2014 → 15 Feb 2014 |
Conference
Conference | Proceedings 8th International Workshop, WALCOM 2014 |
---|---|
Abbreviated title | WALCOM 2014 |
Country/Territory | India |
City | Chennai |
Period | 13 Feb 2014 → 15 Feb 2014 |