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

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Trafodion Cynhadledd (Nid-Cyfnodolyn fathau)

6 Dyfyniadau (Scopus)

Crynodeb

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.

Iaith wreiddiol	Saesneg
Teitl	Algorithms and Computation
Is-deitl	8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings
Golygyddion	Sudebkumar Prasant Pal, Kunihiko Sadakane
Cyhoeddwr	Springer Nature
Tudalennau	80-89
Nifer y tudalennau	10
ISBN (Electronig)	978-3-319-04657-0
ISBN (Argraffiad)	978-3-319-04656-3
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.1007/978-3-319-04657-0_10
Statws	Cyhoeddwyd - 03 Chwef 2014
Cyhoeddwyd yn allanol	Ie
Digwyddiad	Proceedings 8th International Workshop, WALCOM 2014 - Chennai, India Hyd: 13 Chwef 2014 → 15 Chwef 2014

Cynhadledd

Cynhadledd	Proceedings 8th International Workshop, WALCOM 2014
Teitl cryno	WALCOM 2014
Gwlad/Tiriogaeth	India
Dinas	Chennai
Cyfnod	13 Chwef 2014 → 15 Chwef 2014

Mynediad at Ddogfen

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

Cysylltiad parhaol

Dolen barhaus

Dyfynnu hyn

@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. yn SP Pal & K Sadakane (gol.), Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. Springer Nature, tt. 80-89, Proceedings 8th International Workshop, WALCOM 2014, Chennai, India, 13 Chwef 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. gol. / Sudebkumar Prasant Pal; Kunihiko Sadakane. Springer Nature, 2014. t. 80-89.

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Trafodion Cynhadledd (Nid-Cyfnodolyn fathau)

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

Crynodeb

Cynhadledd

Mynediad at Ddogfen

Cysylltiad parhaol

Ôl bys

Dyfynnu hyn