Incremental String Comparison
From MaRDI portal
Recommendations
Cited in
(64)- Semi-local longest common subsequences in subquadratic time
- An \(O(ND)\) difference algorithm and its variations
- Overlap matching.
- Approximate string matching with compressed indexes
- On almost Monge all scores matrices
- Comparison of strings belonging to the same family
- Approximate swapped matching.
- k-approximate quasiperiodicity under Hamming and edit distance
- Approximating the geometric edit distance
- Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny
- Speeding up the detection of tandem repeats over the edit distance
- Efficient all path score computations on grid graphs
- Time-space trade-offs for longest common extensions
- Two algorithms for LCS consecutive suffix alignment
- scientific article; zbMATH DE number 1615270 (Why is no real title available?)
- Fast and cache-oblivious dynamic programming with local dependencies
- Time-Space Trade-Offs for Longest Common Extensions
- Longest common extensions in trees
- Longest common extensions in sublinear space
- Fast and simple computations using prefix tables under Hamming and edit distance
- Longest common extensions in trees
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
- Dynamic RLE-compressed edit distance tables under general weighted cost functions
- Some applications of string algorithms in human-computer interaction
- Periodic String Comparison
- Monge properties of sequence alignment
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Towards hardness of approximation for polynomial time problems
- Dynamic edit distance table under a general weighted cost function
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- Comparing Degenerate Strings
- Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds
- scientific article; zbMATH DE number 7375961 (Why is no real title available?)
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
- Small-space LCE data structure with constant-time queries
- Computing longest common square subsequences
- Combinatorial Pattern Matching
- Pattern matching in pseudo real-time
- Developments in Language Theory
- Fundamentals of Computation Theory
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Approximate periods of strings
- Linear-space S-table algorithms for the longest common subsequence problem
- Pattern matching under DTW distance
- Near-linear time edit distance for indel channels
- Locally consistent decomposition of strings with applications to edit distance sketching
- Weighted edit distance computation: strings, trees, and Dyck
- Minimizers in semi-dynamic strings
- Maintaining the size of LZ77 on semi-dynamic strings
- Approximation algorithms for LCS and LIS with truly improved running times
- Approximating dynamic time warping distance between run-length encoded strings
- Approximate circular pattern matching
- Elastic-degenerate string comparison
- An improved algorithm for the k-Dyck edit distance problem
- Improved approximation for longest common subsequence over small alphabets
- Streaming and small space approximation algorithms for edit distance and longest common subsequence
- Many flavors of edit distance
- Edit distance in near-linear time: it's a constant factor
- Longest common subsequence problem for unoriented and cyclic strings
- A dynamic edit distance table
- An O(NP) sequence comparison algorithm
This page was built for publication: Incremental String Comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388886)
