Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Longest Repeated Substring Problem: Aho-Corasick String Matching Algorithm, Apostolico-Giancarlo Algorithm, Approximate String Matching -

angļu valoda
2026-04-09
137,01 € 195,73 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The longest repeated substring problem is finding the longest substring of a string that occurs at least twice. This problem can be solved in linear time and space by building a suffix tree for the string, and finding the deepest internal node in the tree. The string spelled by the ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The longest repeated substring problem is finding the longest substring of a string that occurs at least twice. This problem can be solved in linear time and space by building a suffix tree for the string, and finding the deepest internal node in the tree. The string spelled by the edges from the root to such a node is a longest repeated substring. The problem of finding the longest substring with at least k occurrences can be found by first preprocessing the tree to count the number of leaf descendants for each internal node, and then finding the deepest node with at least k descendants.

Vairāk informācijas

Izdevējs OmniScriptum
Izlaides gads 2026
Vāka tips Mīkstais vāks
EAN 9786133688957
Rakstiet savu atsauksmi
Jūs vērtējat: Longest Repeated Substring Problem: Aho-Corasick String Matching Algorithm, Apostolico-Giancarlo Algorithm, Approximate String Matching
Jūsu novērtējums:

Goodreads atsauksmes

137,01 € 195,73 €