Border array on bounded alphabet

MaRDI QIDQ3370008zbMATH OpenFDO

Authors Thierry Lecroq, A. Lefebvre, J.-P. Duval

Publication date 6 February 2006

zbMATH Keywords

on-line linear-time algorithm

Mathematics Subject Classification ID

Combinatorics on words (68R15) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1874382
• Efficient validation and construction of border arrays and validation of string matching automata
• Verifying and enumerating parameterized border arrays
• Border Array for Structural Strings
• Counting Parameterized Border Arrays for a Binary Alphabet

Cited in

(21)

• Recognizing union-find trees is NP-complete
• Reconstructing a string from its Lyndon arrays
• String inference from longest-common-prefix array
• Universal reconstruction of a string
• Inferring an indeterminate string from a prefix graph
• Fully bordered words
• On left and right seeds of a string
• Inferring strings from Lyndon factorization
• Border Array for Structural Strings
• On maximal unbordered factors
• Representing prefix and border tables: results on enumeration
• Universal reconstruction of a string
• Counting Parameterized Border Arrays for a Binary Alphabet
• Efficient validation and construction of border arrays and validation of string matching automata
• Indeterminate string inference algorithms
• scientific article; zbMATH DE number 1874382 (Why is no real title available?)
• Indeterminate strings, prefix arrays \& undirected graphs
• Inferring strings from suffix trees and links on a binary alphabet
• Recognizing union-find trees is NP-complete, even without rank info
• Inferring strings from position heaps in linear time
• Verifying and enumerating parameterized border arrays

This page was built for publication: Border array on bounded alphabet

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