Pages that link to "Item:Q1098310"
From MaRDI portal
The following pages link to The longest common subsequence problem revisited (Q1098310):
Displaying 39 items.
- Variants of constrained longest common subsequence (Q407588) (← 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)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization (Q947943) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Fast linear-space computations of longest common subsequences (Q1190449) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← links)
- Multi-subsequence searching (Q1583054) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- About the design of oligo-chips (Q1766743) (← links)
- How hard is computing the edit distance? (Q1854409) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- Searching subsequences (Q2638800) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- (Q3143773) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)
- How hard is to compute the edit distance (Q5055912) (← links)
- (Q5090981) (← links)
- Longest common subsequences (Q5096874) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5111874) (← links)
