Pages that link to "Item:Q4055176"
From MaRDI portal
The following pages link to A linear space algorithm for computing maximal common subsequences (Q4055176):
Displaying 50 items.
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- Multi-sided boundary labeling (Q334944) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- A parallel strategy for biological sequence alignment in restricted memory space (Q436758) (← links)
- A hyper-heuristic for the longest common subsequence problem (Q441749) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics (Q497193) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- Sparse RNA folding: time and space efficient algorithms (Q533404) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- An adaptive multi-policy grid service for biological sequence comparison (Q666033) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- The cache complexity of multithreaded cache oblivious algorithms (Q733717) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- Automatic error correction in flexion languages (Q805262) (← links)
- A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains (Q894024) (← links)
- On a cyclic string-to-string correction problem (Q911767) (← links)
- An O(NP) sequence comparison algorithm (Q912628) (← links)
- Minimum message length encoding and the comparison of macromolecules (Q912791) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- Comparing bacterial genomes from linear orders of patterns (Q947065) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737) (← 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)
- The set LCS problem (Q1101215) (← links)
- Sequence comparison with concave weighting functions (Q1101364) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← 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)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
- On the space complexity of some algorithms for sequence comparison (Q1184980) (← links)
- A time-efficient, linar-space local similarity algorithm (Q1189709) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
