TY - GEN

T1 - Computing the longest common subsequence of two run-length encoded strings

AU - Sakai, Yoshifumi

PY - 2012

Y1 - 2012

N2 - The present article reveals that the problem of finding the longest common subsequence of two strings given in run-length encoded form can be solved in O(mnlog log min(m, n, M/m, N/n, X)) time, where one input string is of length M with m runs, the other is of length N with n runs, and X is the average difference between the length of a run from one input string and that of a run from the other.

AB - The present article reveals that the problem of finding the longest common subsequence of two strings given in run-length encoded form can be solved in O(mnlog log min(m, n, M/m, N/n, X)) time, where one input string is of length M with m runs, the other is of length N with n runs, and X is the average difference between the length of a run from one input string and that of a run from the other.

UR - http://www.scopus.com/inward/record.url?scp=84871550017&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871550017&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-35261-4_23

DO - 10.1007/978-3-642-35261-4_23

M3 - Conference contribution

AN - SCOPUS:84871550017

SN - 9783642352607

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 197

EP - 206

BT - Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings

PB - Springer Verlag

T2 - 23rd International Symposium on Algorithms and Computation, ISAAC 2012

Y2 - 19 December 2012 through 21 December 2012

ER -