Simple Linear Comparison of Strings in V-order*
Alatabbi, A., Daykin, J.W., Rahman, M.S. and Smyth, W.F. (2015) Simple Linear Comparison of Strings in V-order*. Fundamenta Informaticae, 139 (2). pp. 115-126.
*Subscription may be required
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.
|Publication Type:||Journal Article|
|Murdoch Affiliation:||School of Engineering and Information Technology|
|Item Control Page|