Simple Linear Comparison of Strings in V-Order: Extended Abstract

Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman, William F. Smyth

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

6 Citations (SciVal)


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 languageEnglish
Title of host publicationAlgorithms and Computation
Subtitle of host publication8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings
EditorsSudebkumar Prasant Pal, Kunihiko Sadakane
PublisherSpringer Nature
Number of pages10
ISBN (Electronic)978-3-319-04657-0
ISBN (Print)978-3-319-04656-3
Publication statusPublished - 03 Feb 2014
Externally publishedYes
EventProceedings 8th International Workshop, WALCOM 2014 - Chennai, India
Duration: 13 Feb 201415 Feb 2014


ConferenceProceedings 8th International Workshop, WALCOM 2014
Abbreviated titleWALCOM 2014
Period13 Feb 201415 Feb 2014


Dive into the research topics of 'Simple Linear Comparison of Strings in V-Order: Extended Abstract'. Together they form a unique fingerprint.

Cite this