Prefix table construction and conversion

DOI10.1007/978-3-642-45278-9_5MaRDI QIDQ2870015zbMATH OpenOpenAlexWikidataFDO

Authors Widmer Bland, Gregory Kucherov, W. F. Smyth

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)

Recommendations

• Reverse engineering prefix tables
• Representing prefix and border tables: results on enumeration
• On the number of prefix and border tables
• Fast and simple computations using prefix tables under Hamming and edit distance
• Linear-time computation of prefix table for weighted strings {\&} applications

Cited in

(13)

• Finding patterns and periods in Cartesian tree matching
• Inferring an indeterminate string from a prefix graph
• Fast and simple computations using prefix tables under Hamming and edit distance
• Representing prefix and border tables: results on enumeration
• Computing covers using prefix tables
• Indeterminate strings, prefix arrays \& undirected graphs
• On new algorithms of mutual transformation of string schemes
• 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
• Reverse engineering prefix tables
• On the number of prefix and border tables
• String Covering: A Survey

This page was built for publication: Prefix table construction and conversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870015)