Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

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

englanti
2026-04-09
146,80 € 195,73 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

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 ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Julkaisija OmniScriptum
Julkaisuvuosi 2026
Kannen tyyppi Pehmeäkantinen
EAN 9786133688957
Kirjoita oma arvostelusi
Arvostelet: Longest Repeated Substring Problem: Aho-Corasick String Matching Algorithm, Apostolico-Giancarlo Algorithm, Approximate String Matching
Arvostelusi:

Goodreads-arvostelut

146,80 € 195,73 €