On almost Monge all scores matrices
From MaRDI portal
Recommendations
Cites work
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- A dynamic edit distance table
- A space efficient algorithm for finding the best nonoverlapping alignment score
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- A unified algorithm for accelerating edit-distance computation via text-compression
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
- An all-substrings common subsequence algorithm
- An almost quadratic time algorithm for sparse spliced alignment
- Combinatorial Pattern Matching
- Efficient Parallel Algorithms for String Editing and Related Problems
- Efficient all path score computations on grid graphs
- Efficient parallel string comparison
- Fast algorithms for computing tree LCS
- Fundamentals of Computation Theory
- Geometric applications of a matrix-searching algorithm
- Incremental String Comparison
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances
- Multiple-source shortest paths in embedded graphs
- Multiple-source shortest paths in planar graphs
- On the common substring alignment problem
- Perspectives of Monge properties in optimization
- Semi-local longest common subsequences in subquadratic time
- Semi-local string comparison: algorithmic techniques and applications
- Sparse LCS common substring alignment
- String comparison by transposition networks
- Two algorithms for LCS consecutive suffix alignment
Cited in
(3)
This page was built for publication: On almost Monge all scores matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755777)
