Pages that link to "Item:Q547294"

The following pages link to Linear time algorithms for generalizations of the longest common substring problem (Q547294):

Displaying 13 items.

• Inducing enhanced suffix arrays for string collections (Q526901) (← links)
• A substring-substring LCS data structure (Q1625599) (← links)
• A simple algorithm for computing the document array (Q2011038) (← links)
• Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
• The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
• Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
• Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
• LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
• Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
• The longest common substring problem (Q2971067) (← links)
• (Q4929407) (← links)
• Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
• String Processing and Information Retrieval (Q5393947) (← links)