Pages that link to "Item:Q2775894"
From MaRDI portal
The following pages link to On the Common Substring Alignment Problem (Q2775894):
Displayed 21 items.
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- A fast algorithm for multiplying min-sum permutations (Q411869) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- An almost quadratic time algorithm for sparse spliced alignment (Q2429729) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Periodic String Comparison (Q3637113) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)