Simple linear comparison of strings in \(V\)-order (extended abstract). (English) Zbl 1407.68568
Pal, Sudebkumar Prasant (ed.) et al., Algorithms and computation. 8th international workshop, WALCOM 2014, Chennai, India, February 13–15, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8344, 80-89 (2014).
Summary: 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.
For the entire collection see [Zbl 1280.68035].
For the entire collection see [Zbl 1280.68035].
MSC:
| 68W32 | Algorithms on strings |
