I need a developer to build a LCS (Longest Common Subsequence) algorithm that is similar to as given below:
I am wondering if someone has the time to create a C++, Java, or Perl (Providers Choice) program to implement the LCS Problem. This should find the longest common subsequence between 2 strings. The strings should be input by the user. This should print out a table that describes the path of the LCS. IE:
User Prompted for strings 1 and 2, input:
String 1 = XMJYAUZ
String 2 = MZJAWXU
OUTPUT of program::
Table:
(note: to see better format goto wiki here [login to view URL])
| 0 1 2 3 4 5 6 7
| M Z J A W X U
-----|-----------------
0 | 0 0 0 0 0 0 0 0
1 X | 0 0 0 0 0 0 1 1
2 M | 0 1 1 1 1 1 1 1
3 J | 0 1 1 2 2 2 2 2
4 Y | 0 1 1 2 2 2 2 2
5 A | 0 1 1 2 3 3 3 3
6 U | 0 1 1 2 3 3 3 4
7 Z | 0 1 2 2 3 3 3 4
LCS = MJAU
Compiler should be the g++ compiler for a c++ program and this should be a linux/unix environment program run by a MAKEFILE.
I need the LCS algorithm to generate similar string of text to what freelancer.com has. I will be providing copious of data and will need the LCS algorithm to pull out the relevant string of text. We currently have a website that runs on ruby on rails. However I am happy for it to be built on any other platform as long as it works with RoR.
**The web app that I am running uses ruby on rails. Please be sure that it is this going to be able to interact with it?**
Please do the attention on bold letters.
I will select the right candidate with in 1-2 hours after posting this project.