20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

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

English
2026-04-09
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 ... Full description

You May Also Like

Description

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.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786133688957
Write Your Own Review
You're reviewing: Longest Repeated Substring Problem: Aho-Corasick String Matching Algorithm, Apostolico-Giancarlo Algorithm, Approximate String Matching
Your Rating:

Goodreads Reviews

€156.58 €195.73