Efficient all path score computations on grid graphs

We study the Integer-weighted Grid All Paths Scores (IGAPS) problem, which is given a grid graph, to compute the maximum weights of paths between every pair of a vertex on the first row of the graph and a vertex on the last row of the graph. We also consider a variant of this problem, periodic IGAPS, where the input grid graph is periodic and infinite. For these problems, we consider both the general (dense) and the sparse cases. For the sparse periodic IGAPS problem with 0-1 weights, we give an O(rlog^3(n^2/r)) time algorithm, where r is the number of (diagonal) edges of weight 1. Our result improves upon the previous O(nr) result by Krusche and Tiskin for this problem. For the periodic IGAPS problem we give an O(Cn^2) time algorithm, where C is the maximum weight of an edge. This improves upon the previous O(C^2n^2) algorithm of Tiskin. We also show a reduction from periodic IGAPS to IGAPS. This reduction yields o(n^2) algorithms for this problem.

[1]  Edson Cáceres,et al.  An all-substrings common subsequence algorithm , 2008, Discret. Appl. Math..

[2]  Gad M. Landau,et al.  A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression , 2009, STACS.

[3]  Yoshifumi Sakai.  An Almost Quadratic Time Algorithm for Sparse Spliced Alignment , 2009, Theory of Computing Systems.

[4]  Gad M. Landau,et al.  An Algorithm for Approximate Tandem Repeats , 1993, CPM.

[5]  Alexander Tiskin,et al.  Fast Distance Multiplication of Unit-Monge Matrices , 2010, SODA '10.

[6]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[7]  Ayumi Shinohara,et al.  Fully Incremental LCS Computation , 2005, FCT.

[8]  Gary Benson.  A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score , 1995, Theor. Comput. Sci..

[9]  Gad M. Landau,et al.  A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices , 2003, SIAM J. Comput..

[10]  Alexander Tiskin,et al.  Semi-local String Comparison: Algorithmic Techniques and Applications , 2007, Math. Comput. Sci..

[11]  Gad M. Landau,et al.  Incremental String Comparison , 1998, SIAM J. Comput..

[12]  Sung-Ryul Kim,et al.  A Dynamic Edit Distance Table , 2000, CPM.

[13]  Alexander Tiskin.  Semi-local longest common subsequences in subquadratic time , 2008, J. Discrete Algorithms.

[14]  Alexander Tiskin,et al.  Periodic String Comparison , 2009, CPM.

[15]  Heikki Hyyrö.  An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper) , 2008, SPIRE.

[16]  Gad M. Landau,et al.  Sparse LCS Common Substring Alignment , 2003, Inf. Process. Lett..

[17]  Gad M. Landau,et al.  Two Algorithms for LCS Consecutive Suffix Alignment , 2004, CPM.

[18]  Mikhail J. Atallah,et al.  New clique and independent set algorithms for circle graphs , 1992, Discret. Appl. Math..

[19]  Mikhail J. Atallah,et al.  Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[20]  Alexander Tiskin,et al.  New algorithms for efficient parallel string comparison , 2010, SPAA '10.

[21]  Gad M. Landau,et al.  On the Complexity of Sparse Exon Assembly , 2006, J. Comput. Biol..

[22]  Gad M. Landau,et al.  A sub-quadratic sequence alignment algorithm for unrestricted cost matrices , 2002, SODA '02.

[23]  Jeanette P. Schmidt,et al.  All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings , 1998, SIAM J. Comput..

[24]  Sampath Kannan,et al.  An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score , 1996, SIAM J. Comput..

[25]  Alexander Tiskin,et al.  String comparison by transposition networks , 2009, ArXiv.

[26]  Gad M. Landau,et al.  On the Common Substring Alignment Problem , 2001, J. Algorithms.

[27]  Luís M. S. Russo.  Multiplication Algorithms for Monge Matrices , 2010, SPIRE.