Prefix Table Construction and Conversion

DOI10.1007/978-3-642-45278-9_5zbMath1407.68572OpenAlexW1752984WikidataQ58064480 ScholiaQ58064480MaRDI QIDQ2870015

W. F. Smyth, Gregory Kucherov, Widmer Bland

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_5

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (10)

Computing covers using prefix tables ⋮ Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance ⋮ String Covering: A Survey ⋮ Representing prefix and border tables: results on enumeration ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings ⋮ Linear-time computation of prefix table for weighted strings {\&} applications ⋮ A prefix array for parameterized strings ⋮ Inferring an indeterminate string from a prefix graph

This page was built for publication: Prefix Table Construction and Conversion