New data structures for orthogonal range queries
SIAM Journal on Computing
Rapid dynamic programming algorithms for RNA secondary structure
Advances in Applied Mathematics
The concave least-weight subsequence problem revisited
Journal of Algorithms
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On a cyclic string-to-string correction problem
Information Processing Letters
Efficient parallel algorithms for string editing and related problems
SIAM Journal on Computing
Perspectives of Monge properties in optimization
Discrete Applied Mathematics
Pattern matching algorithms
SIAM Journal on Computing
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Well-solved Special Cases of the Traveling Salesman Problem
Well-solved Special Cases of the Traveling Salesman Problem
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
SIAM Journal on Computing
Two algorithms for LCS Consecutive Suffix Alignment
Journal of Computer and System Sciences
An all-substrings common subsequence algorithm
Discrete Applied Mathematics
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
A New Point Access Method Based on Wavelet Trees
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multiplication algorithms for Monge matrices
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Space-Efficient and fast algorithms for multidimensional dominance reporting and counting
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Fully incremental LCS computation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Space-efficient data-analysis queries on grids
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
Alignment is an important sequence comparison measure. Algorithms that compute alignments have a wide range of applications, namely in bioinformatic tools. Alignments can be computed as maximum scoring paths in Alignment DAGs. In this paper we study the properties of matrices that contain alignment scores between a string and all the sub-strings of another string. We focus on the fact that these matrices have the Monge property and are sparse in some sense. Related studies were recently presented for HSM and DIST matrices, leading to O(nlogn) procedure for multiplying those matrices, where O(n) bounds the sizes of the strings. Our results strictly generalize previous solutions. We measure the sparseness of the matrices with variable @d and present an algorithm for matrix multiplication in O((n+@d)log^3(n+@d)) time, which we improve to O((n+@d)log^2(n+@d)), within the same space. We discuss applications of this algorithm, namely fully incremental alignment and alignment update. We study, experimentally, the performance of the methods we propose.