Pages that link to "Item:Q4187318"
From MaRDI portal
The following pages link to Algorithms for the Longest Common Subsequence Problem (Q4187318):
Displaying 50 items.
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Context prediction of mobile users based on time-inferred pattern networks: a probabilistic approach (Q460128) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Sparse RNA folding: time and space efficient algorithms (Q533404) (← links)
- Concordance and consensus (Q545367) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Automatic error correction in flexion languages (Q805262) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- The longest common subsequence problem for arc-annotated sequences (Q876717) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Regular expression constrained sequence alignment (Q925058) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization (Q947943) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Symbolic analysis of indicator time series by quantitative sequence alignment (Q961141) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- The constrained longest common subsequence problem (Q1029006) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737) (← 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 fast algorithm for the longest-common-subsequence problem (Q1155365) (← links)
- Efficient recognition of rational relations (Q1163370) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- On the inadequacy of tournament algorithms for the \(N\)-SCS problem (Q1178218) (← 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)
- Some limit results for longest common subsequences (Q1256321) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← links)
- Simple and fast linear space computation of longest common subsequences (Q1583368) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- Comparison of strings belonging to the same family (Q1818790) (← links)
