Here is an excellent article on finding all common substrings efficiently, with examples in C. This may be overkill if you need just the longest, but it may be easier to understand than the general articles about suffix trees.
More Related Contents:
- Mixing two arrays by alternating elements two by two
- How to find out how many bits are set (equal 1) in the product of two integers [closed]
- banker’s algorithm in c++
- What is the difference between palindrome permutation and permutation? [closed]
- How to replace all occurrences of a character in string?
- Image Processing: Algorithm Improvement for ‘Coca-Cola Can’ Recognition
- Sorting zipped (locked) containers in C++ using boost or the STL
- std::transform() and toupper(), no matching function
- C++ string::find complexity
- C++ Efficiently Calculating a Running Median [duplicate]
- Special simple random number generator
- Finding nearest point in an efficient way
- Fast n choose k mod p for large n?
- TMP: how to generalize a Cartesian Product of Vectors?
- How can std::make_heap be implemented while making at most 3N comparisons?
- Writing a simple equation parser
- What is the right approach when using STL container for median calculation?
- Howto create combinations of several vectors without hardcoding loops in C++?
- Inverting a 4×4 matrix
- Print 2-D Array in clockwise expanding spiral from center
- std::back_inserter for a std::set?
- How to rotate a N x N matrix by 90 degrees? [closed]
- Ways to do modulo multiplication with primitive types
- Removing ‘#include ‘ doesn’t break the code
- Why there is no std::copy_if algorithm?
- LRU implementation in production code
- Is it possible to implement lock free map in C++
- stl ordering – strict weak ordering
- Calculate mean and standard deviation from a vector of samples in C++ using Boost
- Checking if all elements of a vector are equal in C++