Pages that link to "Item:Q4441897"
From MaRDI portal
The following pages link to A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (Q4441897):
Displaying 41 items.
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- Versatile string kernels (Q391141) (← links)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Speeding up transposition-invariant string matching (Q845816) (← 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)
- Parallel comparison of run-length-encoded strings on a linear systolic array (Q867612) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- An efficient alignment algorithm for masked sequences (Q868939) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Edit distance with block deletions (Q1736478) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- A fully compressed algorithm for computing the edit distance of run-length encoded strings (Q1939665) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- (Q5002674) (← links)
- (Q5009573) (← links)
- (Q5091741) (← links)
- (Q5140776) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
