Pages that link to "Item:Q4077436"

The following pages link to Bounds for the String Editing Problem (Q4077436):

Displaying 22 items.

• New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
• An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
• Computing a longest common subsequence for a set of strings (Q786541) (← links)
• Automatic error correction in flexion languages (Q805262) (← links)
• Sequence matching with binary codes (Q911265) (← links)
• New algorithms for the LCS problem (Q1072704) (← links)
• Constrained string editing (Q1099954) (← links)
• A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330) (← links)
• A faster algorithm computing string edit distances (Q1140994) (← links)
• The string merging problem (Q1154285) (← links)
• A fast algorithm for the longest-common-subsequence problem (Q1155365) (← links)
• On the inadequacy of tournament algorithms for the \(N\)-SCS problem (Q1178218) (← links)
• Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
• Optimal parallel detection of squares in strings (Q1194333) (← links)
• Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
• The tree-to-tree editing problem (Q1251477) (← links)
• A bit-string longest-common-subsequence algorithm (Q1996891) (← links)
• (Q3143773) (← links)
• A common basis for similarity measures involving two strings† (Q3962481) (← links)
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
• Longest common subsequences (Q5096874) (← links)
• Fast approximate dictionary matching (Q6487972) (← links)