scientific article; zbMATH DE number 2052918

MaRDI QIDQ4454548zbMATH OpenFDO

Authors Costas S. Iliopoulos, Manal Mohamed, L. Mouchard, W. F. Smyth, K. Perdikuri, Athanasios K. Tsakalidis

Publication date 8 March 2004

zbMATH Keywords

string algorithm

Mathematics Subject Classification ID

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

Recommendations

• Computing regularities in strings: a survey
• scientific article; zbMATH DE number 3949728
• Algorithms for computing the \(\lambda\)-regularities in strings
• Implementing approximate regularities
• An algorithm for string matching with a sequence of don't cares

Cited in

(17)

• Period recovery of strings over the Hamming and edit distances
• Computing regularities in strings: a survey
• String covers of a tree
• Experimental evaluation of algorithms for computing quasiperiods
• Inferring an indeterminate string from a prefix graph
• Some Results for Elementary Operations
• Enhanced string covering
• Indeterminate string inference algorithms
• IDPM: an improved degenerate pattern matching algorithm for biological sequences
• Indeterminate strings, prefix arrays \& undirected graphs
• Linear-time computation of prefix table for weighted strings {\&} applications
• A prefix array for parameterized strings
• Efficient Computation of 2-Covers of a String.
• String Covering: A Survey
• Practical KMP/BM style pattern-matching on indeterminate strings
• A new approach to the periodicity lemma on strings with holes
• Fast pattern-matching on indeterminate strings

This page was built for publication:

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