Efficient Parallel Algorithms for String Editing and Related Problems
From MaRDI portal
Recommendations
Cited in
(32)- Computing the all-pairs longest chains in the plane
- Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy
- Optimal parallel detection of squares in strings
- Monge properties of sequence alignment
- On parallel rectilinear obstacle-avoiding paths
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
- scientific article; zbMATH DE number 4053031 (Why is no real title available?)
- On the complexity of testing for catastrophic faults
- A Probabilistic Analysis of a String Editing Problem and its Variations
- A faster linear systolic algorithm for recovering a longest common subsequence
- On almost Monge all scores matrices
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- A faster parallel algorithm for a matrix searching problem
- On computing all suboptimal alignments
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
- Fast distance multiplication of unit-Monge matrices
- Efficient all path score computations on grid graphs
- scientific article; zbMATH DE number 1263250 (Why is no real title available?)
- scientific article; zbMATH DE number 3883626 (Why is no real title available?)
- Perspectives of Monge properties in optimization
- Parallel rectilinear shortest paths with rectangular obstacles
- Categories, relations and dynamic programming
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
- Constrained many-to-one string editing with memory
- Efficient algorithms for the block edit problems
- Sequence Alignment Algorithms for Run-Length-Encoded Strings
- A faster parallel algorithm for a matrix searching problem
- Unified compression-based acceleration of edit-distance computation
- Fast parallel Lyndon factorization with applications
- Selection and sorting in totally monotone arrays
- A space efficient algorithm for finding the best nonoverlapping alignment score
This page was built for publication: Efficient Parallel Algorithms for String Editing and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495649)
