The following pages link to Incremental String Comparison (Q4388886):
Displaying 39 items.
- Longest common extensions in trees (Q294947) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Dynamic edit distance table under a general weighted cost function (Q491146) (← links)
- Pattern matching in pseudo real-time (Q533411) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- A dynamic edit distance table (Q876720) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Overlap matching. (Q1401926) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Approximating the geometric edit distance (Q2165024) (← links)
- Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny (Q2202162) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Efficient all path score computations on grid graphs (Q2437757) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Two algorithms for LCS consecutive suffix alignment (Q2643733) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS (Q3021984) (← links)
- FINDING ALL APPROXIMATE GAPPED PALINDROMES (Q3069733) (← links)
- Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (Q3177340) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- (Q4638059) (← links)
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- (Q5002705) (← links)
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation (Q5091239) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- (Q5140779) (← links)
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Approximate periods of strings (Q5958136) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
- Near-linear time edit distance for indel channels (Q6487652) (← links)
