Sfdwhf

Creepy dinosaur pc game identification

Why is it that I can sometimes guess the next note?

Non-trope happy ending?

Why did the Mercure fail?

Delivering sarcasm

If a character has darkvision, can they see through an area of nonmagical darkness filled with lightly obscuring gas?

Why Shazam when there is already Superman?

Which one is correct as adjective “protruding” or “protruded”?

It grows, but water kills it

What if a revenant (monster) gains fire resistance?

How can Trident be so inexpensive? Will it orbit Triton or just do a (slow) flyby?

Removing files under particular conditions (number of files, file age)

The screen of my macbook suddenly broken down how can I do to recover

How do I color the graph in datavisualization?

Terse Method to Swap Lowest for Highest?

How could a planet have erratic days?

What prevents the use of a multi-segment ILS for non-straight approaches?

Where does the bonus feat in the cleric starting package come from?

250 Floor Tower

Store Credit Card Information in Password Manager?

Is this toilet slogan correct usage of the English language?

When were female captains banned from Starfleet?

How can "mimic phobia" be cured or prevented?

Yosemite Fire Rings - What to Expect?

Longest common substring in linear time

Computing the longest common substring of two strings using suffix arraysFind longest common substring using a rolling hashWhich algorithm to use to find all common substring (LCS case) with really big stringsFinding the longest repeating subsequenceHow to find longest recurring pattern from lage string data set?Longest substring with consecutive repetitionsDoes the Longest Common Subsequence problem reduce to its binary version?Substring problems in suffix treesNumber of optimal solutions for Longest Common Subsequence (Substring) problemLongest common sequence matrix giving wrong answer

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

edited 1 hour ago

Discrete lizard♦

4,44011537

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

917

$endgroup$

add a comment | 

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

edited 1 hour ago

Discrete lizard♦

4,44011537

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

917

$endgroup$

add a comment | 

$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

edited 1 hour ago

Discrete lizard♦

4,44011537

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

917

$endgroup$

share|cite|improve this question

edited 1 hour ago

Discrete lizard♦

4,44011537

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

917

share|cite|improve this question

edited 1 hour ago

Discrete lizard♦

4,44011537

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

917

edited 1 hour ago

Discrete lizard♦

4,44011537

edited 1 hour ago

Discrete lizard♦

4,44011537

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

917

asked 2 hours ago

Manoharsinh RanaManoharsinh Rana

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

answered 30 mins ago

Apass.JackApass.Jack

13.3k1939

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
  $endgroup$
  – Apass.Jack
  26 mins ago
  
  
  

  
  
  
  

add a comment | 

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

edited 1 hour ago

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  are you talking about subsequence? I am talking about substring.
  $endgroup$
  – Manoharsinh Rana
  1 hour 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♦
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

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

  
  
  
  

add a comment | 

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

answered 49 mins ago

D.W.♦D.W.

102k12127291

$endgroup$

add a comment | 

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

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

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

Name

Email

Required, but never shown

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

answered 30 mins ago

Apass.JackApass.Jack

13.3k1939

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
  $endgroup$
  – Apass.Jack
  26 mins ago
  
  
  

  
  
  
  

add a comment | 

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

answered 30 mins ago

Apass.JackApass.Jack

13.3k1939

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I did not see @D.W's answer, possibly because I was interrupted while writing my answer.
  $endgroup$
  – Apass.Jack
  26 mins ago
  
  
  

  
  
  
  

add a comment | 

$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

answered 30 mins ago

Apass.JackApass.Jack

13.3k1939

$endgroup$

share|cite|improve this answer

answered 30 mins ago

Apass.JackApass.Jack

13.3k1939

answered 30 mins ago

Apass.JackApass.Jack

13.3k1939

answered 30 mins ago

Apass.JackApass.Jack

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

edited 1 hour ago

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  are you talking about subsequence? I am talking about substring.
  $endgroup$
  – Manoharsinh Rana
  1 hour 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♦
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

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

  
  
  
  

add a comment | 

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

edited 1 hour ago

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  are you talking about subsequence? I am talking about substring.
  $endgroup$
  – Manoharsinh Rana
  1 hour 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♦
  1 hour ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

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

  
  
  
  

add a comment | 

$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

edited 1 hour ago

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

$endgroup$

share|cite|improve this answer

edited 1 hour ago

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

answered 1 hour ago

Discrete lizard♦Discrete lizard

4,44011537

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

answered 49 mins ago

D.W.♦D.W.

102k12127291

$endgroup$

add a comment | 

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

answered 49 mins ago

D.W.♦D.W.

102k12127291

$endgroup$

add a comment | 

$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

answered 49 mins ago

D.W.♦D.W.

102k12127291

$endgroup$

share|cite|improve this answer

answered 49 mins ago

D.W.♦D.W.

102k12127291

answered 49 mins ago

D.W.♦D.W.

102k12127291

answered 49 mins ago

D.W.♦D.W.

102k12127291