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

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

doi:10.1007/978-3-319-04657-0_10

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 proceeding › Conference Proceeding (Non-Journal item)

6 Citations (Scopus)

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	https://doi.org/10.1007/978-3-319-04657-0_10
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

Access to Document

10.1007/978-3-319-04657-0_10

Permanent link

Persistent link

Cite this

@inproceedings{7aabe0fa560a4dc985a42615a6b80b99,

title = "Simple Linear Comparison of Strings in V-Order: Extended Abstract",

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.",

author = "Ali Alatabbi and Daykin, {Jacqueline W.} and Rahman, {M. Sohel} and Smyth, {William F.}",

year = "2014",

month = feb,

day = "3",

doi = "10.1007/978-3-319-04657-0_10",

language = "English",

isbn = "978-3-319-04656-3",

pages = "80--89",

editor = "Pal, {Sudebkumar Prasant} and Kunihiko Sadakane",

booktitle = "Algorithms and Computation",

publisher = "Springer Nature",

address = "Switzerland",

note = "Proceedings 8th International Workshop, WALCOM 2014, WALCOM 2014 ; Conference date: 13-02-2014 Through 15-02-2014",

}

Alatabbi, A, Daykin, JW, Rahman, MS & Smyth, WF 2014, Simple Linear Comparison of Strings in V-Order: Extended Abstract. in SP Pal & K Sadakane (eds), Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. Springer Nature, pp. 80-89, Proceedings 8th International Workshop, WALCOM 2014, Chennai, India, 13 Feb 2014. https://doi.org/10.1007/978-3-319-04657-0_10

Simple Linear Comparison of Strings in V-Order: Extended Abstract. / Alatabbi, Ali; Daykin, Jacqueline W.; Rahman, M. Sohel et al.
Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. ed. / Sudebkumar Prasant Pal; Kunihiko Sadakane. Springer Nature, 2014. p. 80-89.

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

TY - GEN

T1 - Simple Linear Comparison of Strings in V-Order

T2 - Proceedings 8th International Workshop, WALCOM 2014

AU - Alatabbi, Ali

AU - Daykin, Jacqueline W.

AU - Rahman, M. Sohel

AU - Smyth, William F.

PY - 2014/2/3

Y1 - 2014/2/3

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-04657-0_10

DO - 10.1007/978-3-319-04657-0_10

M3 - Conference Proceeding (Non-Journal item)

SN - 978-3-319-04656-3

SP - 80

EP - 89

BT - Algorithms and Computation

A2 - Pal, Sudebkumar Prasant

A2 - Sadakane, Kunihiko

PB - Springer Nature

Y2 - 13 February 2014 through 15 February 2014

ER -

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

Abstract

Conference

Access to Document

Permanent link

Fingerprint

Cite this