Efficient Parallel Algorithms for String Editing and Related Problems
DOI10.1137/0219066zbMATH Open0711.68055DBLPjournals/siamcomp/ApostolicoALM90OpenAlexW2096827683WikidataQ56813836 ScholiaQ56813836MaRDI QIDQ3495649FDOQ3495649
Authors: Alberto Apostolico, Lawrence L. Larmore, Scott McFaddin, Mikhail J. Atallah 
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1624&context=cstech
Recommendations
shortest pathsparallel computationstring searchingdivide and conquerstring-to-string correctionedit operationsstring editing problem
Cited In (32)
- Computing the all-pairs longest chains in the plane
- Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
- Optimal parallel detection of squares in strings
- Monge properties of sequence alignment
- On parallel rectilinear obstacle-avoiding paths
- Title not available (Why is that?)
- 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
- A faster parallel algorithm for a matrix searching problem
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- On computing all suboptimal alignments
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Sequence Alignment Algorithms for Run-Length-Encoded Strings
- Efficient algorithms for the block edit problems
- 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)
