论文信息 - The longest common parameterized subsequence problem - 字舞流文

The longest common parameterized subsequence problem

In this paper we describe an approach to solve the problem of the longest common parameterized subsequence. This approach is based on constructing logical models for LCPS. Mathematics Subject Classification: 03D15, 68Q17

A. Gorbenko | V. Popov

[1] V. Ramachandran. Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms , 1993 .

[2] S. Muthukrishnan,et al. Alphabet Dependence in Parameterized Matching , 1994, Inf. Process. Lett..

[3] Brenda S. Baker. Parameterized Pattern Matching: Algorithms and Applications , 1996, J. Comput. Syst. Sci..

[4] Brenda S. Baker. Parameterized diff , 1999, SODA '99.

[5] Moshe Lewenstein,et al. Approximate Parameterized Matching , 2004, ESA.

[6] Moshe Lewenstein,et al. On the Longest Common Parameterized Subsequence , 2008, CPM.

[7] Anna Gorbenko,et al. Programming for Modular Reconfigurable Robots , 2011 .

[8] Anna Gorbenko,et al. The problem of placement of visual landmarks , 2011 .

[9] A. Gorbenko,et al. Planning a Typical Working Day for Indoor Service Robots , 2011 .

[10] Anna Gorbenko,et al. The Problem of Sensor Placement , 2012 .

[11] Andrey Sheka,et al. Localization on Discrete Grid Graphs , 2012 .