scientific article; zbMATH DE number 139916

MaRDI QIDQ4028258zbMATH OpenFDO

Authors Frank Owen Hadlock

Publication date 28 March 1993

zbMATH Keywords

efficient algorithmminimum detour algorithmset sequence classificationset sequence matchingshortest path problemtransformation graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Review text

[For the entire collection see Zbl 0747.00032.] The problem of comparing strings or sequences has various applications to spelling correction, pattern classification, and coding theory, as well as to file comparison. This article introduces a generalization of this problem, along with an efficient algorithm for its solution.

Recommendations

• Alignments and approximate string matching
• Efficient algorithms for similarity search
• String Processing and Information Retrieval
• Data structures and algorithms for approximate string matching
• scientific article; zbMATH DE number 1445380

Cited in

(4)

• Set intersection and sequence matching with mismatch counting
• scientific article; zbMATH DE number 1142928 (Why is no real title available?)
• Comparing finite sequences of discrete events with non-uniform time intervals
• Efficient algorithms for similarity search

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 Q4028258)