. "14" . . "11320" . "RIV/00216208:11320/07:00004290!RIV08-MSM-11320___" . "\u010Cl\u00E1nek se zab\u00FDv\u00E1 n\u00E1sleduj\u00EDc\u00EDm probl\u00E9mem: pro dva dan\u00E9 \u0159et\u011Bzce A a B, ur\u010Dete nejmen\u0161\u00ED po\u010Det p\u0159eklopen\u00ED, kter\u00E9 p\u0159evede \u0159et\u011Bzec A na \u0159et\u011Bzec B."@cs . "Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (Article R50)" . "11"^^ . . "447668" . "Electronic Journal of Combinatorics" . . "1"^^ . "1;11" . "1077-8926" . "[D00694535C60]" . . . "P(1M0545), Z(MSM0021620838)" . . "1" . . . "2"^^ . . "RIV/00216208:11320/07:00004290" . . . . "The paper studies the following problem: given two strings, A and B, find the minimum number of reversals that transform the string A into the string B."@en . "Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (Article R50)"@en . "Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (Article R50)"@en . "Reversal; Distance; Strings; Duplicates; Linear; Approximation; using; Hitting; Article"@en . . "Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (Article R50)" . . "Kolman, Petr" . "The paper studies the following problem: given two strings, A and B, find the minimum number of reversals that transform the string A into the string B." . "P\u0159ekl\u00E1p\u011Bc\u00ED vzd\u00E1lenost \u0159et\u011Bzc\u016F s opakov\u00E1n\u00EDm"@cs . . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . . . . . . . . "P\u0159ekl\u00E1p\u011Bc\u00ED vzd\u00E1lenost \u0159et\u011Bzc\u016F s opakov\u00E1n\u00EDm"@cs .