Simple Linear Comparison of Strings in V-Order

DOI10.1007/978-3-319-04657-0_10zbMath1407.68568OpenAlexW2236571779MaRDI QIDQ5746248

Ali Alatabbi, Jackie Daykin, M. Sohel Rahman, W. F. Smyth

Publication date: 18 February 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_10

zbMATH Keywords

complexityalgorithmcomparisonlexicographic orderlineartotal orderstring\(V\)-orderworddata structurearrayLyndon wordlinked-list

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (4)

\(V\)-order: new combinatorial properties \& a simple comparison algorithm ⋮ String rearrangement inequalities and a total order between primitive words ⋮ A bijective variant of the Burrows-Wheeler transform using \(V\)-order ⋮ Computation of the suffix array, Burrows-Wheeler transform and FM-index in \(V\)-order

This page was built for publication: Simple Linear Comparison of Strings in V-Order