Author:
Ann Hsing-Yen,Yang Chang-Biau,Tseng Chiou-Ting,Hor Chiou-Yi
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings;Ann;Information Processing Letters,2008
2. Matching for run-length encoded strings;Apostolico;Journal of Complexity,1999
3. Regular expression constrained sequence alignment;Arslan;Journal of Discrete Algorithms,2007
4. Algorithms for the constrained longest common subsequence problems;Arslan;International Journal of Foundations Computer Science,2005
5. 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.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献