Suffix trees can be used to solve a large number of string problems that occur in text-editing, free-text search, computational biology and other application areas.[19] Primary applications include:[19] String search, in O(m) complexity, where m is the length of the sub-string (but with initial O(n) time required to build the suffix tree for the string)Finding the longest repeated substringFinding the longest common substringFinding the longest palindrome in a string - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18
27 Mar 2019 09:43 AM study24x7 study24x7

Suffix trees can be used to solve a large number of string problems that occur in text-editing, free-text search, computational biology and other application areas.[19] Primary applications include:[19] String search, in O(m) complexity, where m is the length of the sub-string (...

See more

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles