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. © 2014 Springer International Publishing Switzerland.
Author supplied keywords
Cite
CITATION STYLE
Alatabbi, A., Daykin, J., Rahman, M. S., & Smyth, W. F. (2014). Simple linear comparison of strings in V-order (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8344 LNCS, pp. 80–89). Springer Verlag. https://doi.org/10.1007/978-3-319-04657-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
