Longest common substring in linear time












2












$begingroup$


We know that the longest common substring of two strings can be found in O(N^2) time complexity.
Can a solution be found in only linear time?






algorithms time-complexity strings longest-common-substring







share|cite|improve this question











$endgroup$

















    2












    $begingroup$


    We know that the longest common substring of two strings can be found in O(N^2) time complexity.
    Can a solution be found in only linear time?






    algorithms time-complexity strings longest-common-substring







    share|cite|improve this question











    $endgroup$















      2












      2








      2





      $begingroup$


      We know that the longest common substring of two strings can be found in O(N^2) time complexity.
      Can a solution be found in only linear time?






      algorithms time-complexity strings longest-common-substring







      share|cite|improve this question











      $endgroup$




      We know that the longest common substring of two strings can be found in O(N^2) time complexity.
      Can a solution be found in only linear time?






      algorithms time-complexity strings longest-common-substring




      algorithms time-complexity strings longest-common-substring






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 4 hours ago









      Discrete lizard♦

      4,44011537




      4,44011537










      asked 4 hours ago









      Manoharsinh RanaManoharsinh Rana

      917




      917






















          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



          Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




          The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




          Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






          share|cite|improve this answer









          $endgroup$





















            1












            $begingroup$

            It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^{2-varepsilon})$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



            SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^{2-varepsilon})$ time algorithm exists.




            While finding a substring is a slightly different problem, it seems likely to be equally hard.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              are you talking about subsequence? I am talking about substring.
              $endgroup$
              – Manoharsinh Rana
              4 hours ago












            • $begingroup$
              @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
              $endgroup$
              – Discrete lizard♦
              3 hours ago










            • $begingroup$
              Longest common substring is much easier than longest common subsequence. See my answer.
              $endgroup$
              – D.W.♦
              2 hours ago



















            1












            $begingroup$

            Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



            In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



            Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






            share|cite|improve this answer









            $endgroup$













              Your Answer





              StackExchange.ifUsing("editor", function () {
              return StackExchange.using("mathjaxEditing", function () {
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
              });
              });
              }, "mathjax-editing");

              StackExchange.ready(function() {
              var channelOptions = {
              tags: "".split(" "),
              id: "419"
              };
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function() {
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled) {
              StackExchange.using("snippets", function() {
              createEditor();
              });
              }
              else {
              createEditor();
              }
              });

              function createEditor() {
              StackExchange.prepareEditor({
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader: {
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              },
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              });


              }
              });














              draft saved

              draft discarded


















              StackExchange.ready(
              function () {
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f105969%2flongest-common-substring-in-linear-time%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              2












              $begingroup$

              Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



              Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




              The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




              Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






              share|cite|improve this answer









              $endgroup$


















                2












                $begingroup$

                Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



                Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




                The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




                Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






                share|cite|improve this answer









                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



                  Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




                  The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




                  Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.






                  share|cite|improve this answer









                  $endgroup$



                  Yes, the longest common substring of two strings can be found in $O(m+n)$ time, where $m$ and $n$ are the lengths of the two strings, assuming the size of the alphabet is constant.



                  Here is an excerpt from https://en.wikipedia.org/wiki/Longest_common_substring_problem.




                  The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and then finding the deepest internal nodes which have leaf nodes from all the strings in the subtree below it.




                  Building a generalized suffix tree for two given strings takes $Theta(m+n)$ time using the famous ingenious Ukkonen's algorithm. Finding the deepest internal nodes that come from both strings takes $Theta(m+n)$ time. Hence we can find the longest common substring in $Theta(m+n)$ time.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 2 hours ago









                  Apass.JackApass.Jack

                  13.3k1939




                  13.3k1939























                      1












                      $begingroup$

                      It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^{2-varepsilon})$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



                      SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^{2-varepsilon})$ time algorithm exists.




                      While finding a substring is a slightly different problem, it seems likely to be equally hard.






                      share|cite|improve this answer











                      $endgroup$













                      • $begingroup$
                        are you talking about subsequence? I am talking about substring.
                        $endgroup$
                        – Manoharsinh Rana
                        4 hours ago












                      • $begingroup$
                        @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
                        $endgroup$
                        – Discrete lizard♦
                        3 hours ago










                      • $begingroup$
                        Longest common substring is much easier than longest common subsequence. See my answer.
                        $endgroup$
                        – D.W.♦
                        2 hours ago
















                      1












                      $begingroup$

                      It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^{2-varepsilon})$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



                      SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^{2-varepsilon})$ time algorithm exists.




                      While finding a substring is a slightly different problem, it seems likely to be equally hard.






                      share|cite|improve this answer











                      $endgroup$













                      • $begingroup$
                        are you talking about subsequence? I am talking about substring.
                        $endgroup$
                        – Manoharsinh Rana
                        4 hours ago












                      • $begingroup$
                        @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
                        $endgroup$
                        – Discrete lizard♦
                        3 hours ago










                      • $begingroup$
                        Longest common substring is much easier than longest common subsequence. See my answer.
                        $endgroup$
                        – D.W.♦
                        2 hours ago














                      1












                      1








                      1





                      $begingroup$

                      It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^{2-varepsilon})$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



                      SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^{2-varepsilon})$ time algorithm exists.




                      While finding a substring is a slightly different problem, it seems likely to be equally hard.






                      share|cite|improve this answer











                      $endgroup$



                      It is unlikely that that a better algorithm than quadratic exists, let alone linear. For the related problem of finding subsequences, this is a known result: In the paper "Tight hardness results for LCS and other sequence similarity measures." by Abboud et al. , they show that the existence of an algorithm with a running time of $O(n^{2-varepsilon})$, for some $varepsilon>0$ refutes the Strong Exponential Time Hypothesis (SETH).



                      SETH is considered to be very likely true (although not universally accepted), so it is unlikely any $O(n^{2-varepsilon})$ time algorithm exists.




                      While finding a substring is a slightly different problem, it seems likely to be equally hard.







                      share|cite|improve this answer














                      share|cite|improve this answer



                      share|cite|improve this answer








                      edited 3 hours ago

























                      answered 4 hours ago









                      Discrete lizard♦Discrete lizard

                      4,44011537




                      4,44011537












                      • $begingroup$
                        are you talking about subsequence? I am talking about substring.
                        $endgroup$
                        – Manoharsinh Rana
                        4 hours ago












                      • $begingroup$
                        @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
                        $endgroup$
                        – Discrete lizard♦
                        3 hours ago










                      • $begingroup$
                        Longest common substring is much easier than longest common subsequence. See my answer.
                        $endgroup$
                        – D.W.♦
                        2 hours ago


















                      • $begingroup$
                        are you talking about subsequence? I am talking about substring.
                        $endgroup$
                        – Manoharsinh Rana
                        4 hours ago












                      • $begingroup$
                        @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
                        $endgroup$
                        – Discrete lizard♦
                        3 hours ago










                      • $begingroup$
                        Longest common substring is much easier than longest common subsequence. See my answer.
                        $endgroup$
                        – D.W.♦
                        2 hours ago
















                      $begingroup$
                      are you talking about subsequence? I am talking about substring.
                      $endgroup$
                      – Manoharsinh Rana
                      4 hours ago






                      $begingroup$
                      are you talking about subsequence? I am talking about substring.
                      $endgroup$
                      – Manoharsinh Rana
                      4 hours ago














                      $begingroup$
                      @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
                      $endgroup$
                      – Discrete lizard♦
                      3 hours ago




                      $begingroup$
                      @ManoharsinhRana Ah, I see. The problems are similar, and it is hard to find results for the string variant. I think there are similar results for the substring problem, but they are not easy to find. You could try looking at papers that cite "Quadratic conditional lower bounds for string problems and dynamic time warping" by Bringmann and Künnemann, as their program lead to a lot of results related to this problem.
                      $endgroup$
                      – Discrete lizard♦
                      3 hours ago












                      $begingroup$
                      Longest common substring is much easier than longest common subsequence. See my answer.
                      $endgroup$
                      – D.W.♦
                      2 hours ago




                      $begingroup$
                      Longest common substring is much easier than longest common subsequence. See my answer.
                      $endgroup$
                      – D.W.♦
                      2 hours ago











                      1












                      $begingroup$

                      Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



                      In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



                      Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






                      share|cite|improve this answer









                      $endgroup$


















                        1












                        $begingroup$

                        Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



                        In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



                        Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






                        share|cite|improve this answer









                        $endgroup$
















                          1












                          1








                          1





                          $begingroup$

                          Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



                          In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



                          Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)






                          share|cite|improve this answer









                          $endgroup$



                          Yes. There's even a Wikipedia article about it! https://en.wikipedia.org/wiki/Longest_common_substring_problem



                          In particular, as Wikipedia explains, there is a linear-time algorithm, using suffix trees (or suffix arrays).



                          Searching on "longest common substring" turns up that Wikipedia article as the first hit (for me). In the future, please research the problem before asking here. (See, e.g., https://meta.stackoverflow.com/q/261592/781723.)







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered 3 hours ago









                          D.W.♦D.W.

                          102k12127291




                          102k12127291






























                              draft saved

                              draft discarded




















































                              Thanks for contributing an answer to Computer Science Stack Exchange!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid …



                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.


                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f105969%2flongest-common-substring-in-linear-time%23new-answer', 'question_page');
                              }
                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              -

                              Popular posts from this blog

                              Contact image not getting when fetch all contact list from iPhone by CNContact

                              Image
                              up vote 0 down vote favorite I know this question already asked but not getting solution. From this code I will get all the information from the contact but image not found when open vcf files on mac os, also not getting when share this file. I use this stackoverflow link here but It's not help full. var contacts = [CNContact]() let keys = [CNContactVCardSerialization.descriptorForRequiredKeys() ] as [Any] let request = CNContactFetchRequest(keysToFetch: keys as! [CNKeyDescriptor]) do { try self.contactStore.enumerateContacts(with: request) { (contact, stop) in // Array containing all unified contacts from everywhere contacts.append(contact) } } catch { print("unable to fetch contacts") } do { let data = try
                              Read more

                              count number of partitions of a set with n elements into k subsets

                              Image
                              up vote 6 down vote favorite 1 This program is for count number of partitions of a set with n elements into k subsets I am confusing here return k*countP(n-1, k) + countP(n-1, k-1); can some one explain what is happening here? why we are multiplying with k? NOTE->I know this is not the best way to calculate number of partitions that would be DP // A C++ program to count number of partitions // of a set with n elements into k subsets #include<iostream> using namespace std; // Returns count of different partitions of n // elements in k subsets int countP(int n, int k) { // Base cases if (n == 0 || k == 0 || k > n) return 0; if (k == 1 || k == n) return 1; // S(n+1, k) = k*S(n, k) + S(n, k-1) return k*countP(n-1, k) + countP(n-1, k-1); } // Driver program int ma
                              Read more

                              A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

                              Image
                              0 I found a lot of questions abount appendices and ToC. Many users want appendices to be grouped in an Appendix part, however some problems arise with ToC, hyperref, PDF viewer bookmarks, and so on. There are different solutions which require extra packages, command patching and other extra code, however none of them satisfies me. I almost found an easy way to accomplish a good result, where appendices are added to bookmarks in the right way and hyperref links point to the right page. However, the number of the "Appendix" part page is wrong (it's the number of appendix A). Is there any EASY way to fix that? This is a MWE: documentclass{book} usepackage[nottoc,notlot,notlof]{tocbibind} usepackage{hyperref} begin{document} frontmatter tableofcontents mainmatter part{First} chapter{
                              Read more