Author:
Ann Hsing-Yen,Yang Chang-Biau,Tseng Chiou-Ting,Hor Chiou-Yi
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference16 articles.
1. Matching for run-length encoded strings;Apostolico;Journal of Complexity,1999
2. Edit distance of run-length encoded strings;Arbell;Information Processing Letters,2002
3. M.A. Bender, M. Farach-Colton, The LCA problem revisited, in: LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, 2000, pp. 88–94
4. An improved algorithm for computing the edit distance of run-length coded strings;Bunke;Information Processing Letters,1995
5. Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism;Freschi;Information Processing Letters,2004
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献