scientific article; zbMATH DE number 2052918

zbMATH Open1061.68188MaRDI QIDQ4454548FDOQ4454548

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

Publication date: 8 March 2004

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

string algorithm

Mathematics Subject Classification ID

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

Cited In (17)

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