. "4"^^ . . "Data mining VI" . "Srovn\u00E1n\u00ED dvou algoritm\u016F pro hled\u00E1n\u00ED opakovan\u00FDch sekvenc\u00ED slov"@cs . "S" . . "RIV/49777513:23520/05:00000585!RIV07-MSM-23520___" . "We will make the readers of this paper familiar with two basic approaches to repeated sequences extraction - a suffix tree based method and an inverted list based method. Finally, we will suggest several possible applications of repeated sequences." . "repeated sequences; repeated segments; frequent phrases; suffix tree; algorithms; comparison"@en . "1-84564-017-9" . "510801" . "WIT Press" . . "Srovn\u00E1n\u00ED dvou algoritm\u016F pro hled\u00E1n\u00ED opakovan\u00FDch sekvenc\u00ED slov"@cs . . . . . "2005-01-01+01:00"^^ . "A comparison of two algorithms for discovering repeated word sequences"@en . . . . "Rousselot, Francois" . . "121-131" . "\u010Cten\u00E1\u0159i tohoto \u010Dl\u00E1nku budou sezn\u00E1meni s dv\u011Bma p\u0159\u00EDstupy k hled\u00E1n\u00ED opakovan\u00FDch sekvenc\u00ED v textech - jedn\u00EDm je metoda zalo\u017Een\u00E1 na sufix tree stromech a druh\u00E1 je zalo\u017Eena na invertovan\u00E9m seznamu. V z\u00E1v\u011Bru je uvedeno n\u011Bkolik \u010Dast\u00FDch palikac\u00ED opakovan\u00FDch sekvenc\u00ED."@cs . "Fiala, Dalibor" . "We will make the readers of this paper familiar with two basic approaches to repeated sequences extraction - a suffix tree based method and an inverted list based method. Finally, we will suggest several possible applications of repeated sequences."@en . . . "A comparison of two algorithms for discovering repeated word sequences"@en . . "Tesa\u0159, Roman" . "\u0158ecko, Skiathos" . "Southampton" . . . "23520" . "RIV/49777513:23520/05:00000585" . . . "Je\u017Eek, Karel" . "3"^^ . "A comparison of two algorithms for discovering repeated word sequences" . "[D7F5F96CD905]" . "11"^^ . . "A comparison of two algorithms for discovering repeated word sequences" .