. . . . "RIV/68407700:21230/03:03088936" . "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 . "Polcar, Tom\u00E1\u0161" . . . "The Longest Common Subsequence Problem a Finite Automata Approach" . "2"^^ . "[B2F0BAFF02A0]" . "RIV/68407700:21230/03:03088936!RIV/2004/GA0/212304/N" . . "2003-02-10+01:00"^^ . . "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." . . "Praha" . "P(GA201/01/1433), Z(MSM 212300014)" . . "Praha" . . . . "2"^^ . "2"^^ . "21230" . . "The Longest Common Subsequence Problem a Finite Automata Approach" . . "Melichar, Bo\u0159ivoj" . "80-01-02708-2" . "The Longest Common Subsequence Problem a Finite Automata Approach"@en . . . "Proceedings of Workshop 2003" . "\u010Cesk\u00E9 vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Praze" . . "613849" . "The Longest Common Subsequence Problem a Finite Automata Approach"@en . . "326 ; 327" . "finite automata, common subsequence automata, longest common subsequence"@en .