Pages that link to "Item:Q4077445"
From MaRDI portal
The following pages link to Bounds on the Complexity of the Longest Common Subsequence Problem (Q4077445):
Displayed 47 items.
- Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- A systolic array for the longest common subsequence problem (Q1066678) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings (Q1085982) (← links)
- The longest common subsequence problem revisited (Q1098310) (← links)
- Constrained string editing (Q1099954) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← 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)
- A fast algorithm for the longest-common-subsequence problem (Q1155365) (← links)
- Behandlung verschiedener INTEGER-Darstellungen durch optimierende Compiler (Q1157142) (← links)
- The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- An information-theoretic lower bound for the longest common subsequence problem (Q1241422) (← links)
- The tree-to-tree editing problem (Q1251477) (← links)
- Some limit results for longest common subsequences (Q1256321) (← links)
- Matching for run-length encoded strings (Q1288529) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
- A bit-string longest-common-subsequence algorithm (Q1996891) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Searching subsequences (Q2638800) (← links)
- (Q3143773) (← links)
- Constrained LCS: Hardness and Approximation (Q3506958) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- A common basis for similarity measures involving two strings† (Q3962481) (← links)
- DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
- Longest common subsequences (Q5096874) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5111874) (← links)
- Mining Bit-Parallel LCS-length Algorithms (Q5150933) (← links)
- A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence (Q6075744) (← links)