I have a question regarding finding the longest common substring in R. While searching through a few posts on StackOverflow, I got to know about the qualV package. However, I see that the LCS funct...

Is there any way of finding the longest common subsequence of two sequences in O(NlogN) time? I read somewhere that there is a way to achieve this using binary search. I know the dp approach th...

I am trying to find the longest common subsequence of 3 or more strings. The Wikipedia article has a great description of how to do this for 2 strings, but I'm a little unsure of how to extend this...

Among several dp solutions for this question, an easier solution is to reverse the given string and calculate LCS of the original and reversed string. My question is will this approach yield corr...

Playing around with the standard linux diff command, I could not find a way to avoid the following type of grouping in its output (the output listings here assume the unified format) This question...

I searched online for a C++ Longest Common Substring implementation but failed to find a decent one. I need a LCS algorithm that returns the substring itself, so it's not just LCS. I was wondering...

Say I have one large string and an array of substrings that when joined equal the large string (with small differences). For example (note the subtle differences between the strings): large_str =...

The longest common subsequence problem is a classic computer science problem, and algorithms to solve it are the root of version control systems and wiki engines. Two basic algorithms are the Hunt–...

In order to find the minimal number of insertions required to convert a given string(s) to palindrome I find the longest common subsequence of the string(lcs_string) and its reverse. Therefor...

I do not understand the O(2^n) complexity that the recursive function for the Longest Common Subsequence algorithm has. Usually, I can tie this notation with the number of basic operations (in thi...

Regarding how they work, I was wondering low-level working stuff: What will trigger a merge conflict? Is the context also used by the tools in order to apply the patch? How do they deal with chan...

I have two strings, both the same length. And I've to check if them can be expressed as XYZ and XZY, where Y and Z are not empty. My solution is to 'eat' the same first letters of both strings and...

I have implemented the longest common subsequence problem as instructed in this video. It just execute first set of code and produces an empty list. What is wrong with this implementation? def lcs...

Consider 2 sequences X[1..m] and Y[1..n]. The memoization algorithm would compute the LCS in time O(m*n). Is there any better algorithm to find out LCS wrt time? I guess memoization done diagonally...

I'm looking for a (space) efficient implementation of an LCS algorithm for use in a C++ program. Inputs are two random access sequences of integers. I'm currently using the dynamic programming appr...

I have two character variables (names of objects) and I want to extract the largest common substring. a <- c('blahABCfoo', 'blahDEFfoo') b <- c('XXABC-123', 'XXDEF-123') I want the followi...

I've designed an algorithm to find the longest common subsequence. these are steps: Pick the first letter in the first string. Look for it in the second string and if its found, Add that letter ...

Hello fellow programmers, I would like to ask for some help with regards to near matches of strings. Currently, I have a program that stores strings of description, users can search for descript...

Problem: Need the Length of the LCS between two strings. The size of the strings is at most 100 characters. The alphabet is the usual DNA one, 4 characters "ACGT". The dynamic approach is not quick...

I'm working in Flex/AS3 on (for simplicity) an XML editor. I need to provide undo/redo functionality. Of course, one solution is to store the entire source text with each edit. However, to conserv...