Pages that link to "Item:Q3495649"

The following pages link to Efficient Parallel Algorithms for String Editing and Related Problems (Q3495649):

Displaying 31 items.

• A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
• Monge properties of sequence alignment (Q418004) (← links)
• Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy (Q547283) (← links)
• A space efficient algorithm for finding the best nonoverlapping alignment score (Q673113) (← links)
• Efficient algorithms for the block edit problems (Q963999) (← links)
• Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
• Optimal parallel detection of squares in strings (Q1194333) (← links)
• A faster parallel algorithm for a matrix searching problem (Q1206437) (← links)
• On computing all suboptimal alignments (Q1291563) (← links)
• On parallel rectilinear obstacle-avoiding paths (Q1314529) (← links)
• Constrained many-to-one string editing with memory (Q1358830) (← links)
• On almost Monge all scores matrices (Q1755777) (← links)
• An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
• An improved algorithm for tree edit distance with applications for RNA secondary structure comparison (Q2015811) (← links)
• Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
• Efficient all path score computations on grid graphs (Q2437757) (← links)
• (Q3217617) (← links)
• Sequence Alignment Algorithms for Run-Length-Encoded Strings (Q3511343) (← links)
• Selection and sorting in totally monotone arrays (Q3979609) (← links)
• (Q4234122) (← links)
• Categories, relations and dynamic programming (Q4286530) (← links)
• Fast parallel Lyndon factorization with applications (Q4327381) (← links)
• A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)
• A faster parallel algorithm for a matrix searching problem (Q5056103) (← links)
• Computing the all-pairs longest chains in the plane (Q5060093) (← links)
• An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)
• On the complexity of testing for catastrophic faults (Q6487962) (← links)