Abstract
Given two strings described by SLPs of total size n, we show how to compute their edit distance in time, where N is the sum of the strings length. The result can be generalized to any rational scoring function, hence we improve the existing [10] and [4] time solutions. This gets us even closer to the complexity conjectured by Lifshits [7]. The basic tool in our solution is a linear time procedure for computing the max-product of a vector and a unit-Monge matrix, which might be of independent interest. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gawrychowski, P. (2012). Faster algorithm for computing the edit distance between slp-compressed strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7608 LNCS, pp. 229–236). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
