. "2003-07-16+02:00"^^ . "Polcar, Tom\u00E1\u0161" . "The Longest Common Subsequence Problem - A Finite Automata Approach"@en . . "RIV/68407700:21230/03:03088938!RIV/2004/GA0/212304/N" . "3"^^ . . "613850" . "Springer-Verlag" . "A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in O(|A|(|S1|+|S2|+r)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and r is the number of matching pairs (such pair i,j that S1(i)=S2(j)). This algorithm can be simple generalized for multiple strings." . . . . "New York" . "2"^^ . "21230" . . . . "P(GA201/01/1433), Z(MSM 212300014)" . "3-540-40561-5" . "The Longest Common Subsequence Problem - A Finite Automata Approach"@en . "294 ; 296" . . . "2"^^ . . "The Longest Common Subsequence Problem - A Finite Automata Approach" . "Melichar, Bo\u0159ivoj" . "Santa Barbara,CA" . . . "Implementation and Application of Automata" . "finite automata, common subsequence automata, longest common subsequence"@en . . . "The Longest Common Subsequence Problem - A Finite Automata Approach" . . . "RIV/68407700:21230/03:03088938" . . "A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in O(|A|(|S1|+|S2|+r)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and r is the number of matching pairs (such pair i,j that S1(i)=S2(j)). This algorithm can be simple generalized for multiple strings."@en . "[AF1529414369]" .