hhm forget it! :D
i've found the algorithm by myself, simply, just use if looping function..
dear admin, lock please :)
abz89
Last Activity: Aug 16 '10, 08:11 AM
Joined: Mar 22 '10
Location:
-
Traffic system of train simulation
hi for all byte's member :D
just want to ask, recently i've tried many of programming language. And as my test application, i want to create a little program that simulating train traffic.
i,e. train go from station A then station B. After that, the train have moving reverse, from B to A
...Code:train@station A B .=======>>--------------------------.
-
i've pre-finished my program with hirscberg :D
thx for everyone ;)
to mod;please lock this thread, if you would..Leave a comment:
-
okay, i'll try it..
thx.. :DLeave a comment:
-
<quote>
1. Optimization: convertStringTo Arr
You create a list, and then you copy the list into a int[] array. Why not create the int[] array to begin with?
</quote>
hmm, i will make the GUI for this program with string1 and string2 input fron text box, so i designed it is like this...
<quote>2. Error
for(int y=0;y<source.Le ngth;y++)
for(int x=0;x<dest.Leng th;x++)...Leave a comment:
-
Leave a comment:
-
@jkmyoung
yupz, hirschberg is only calculated the single row and above ones then immedietly flushing the memory with throw the other unnecessary datas..
but it taking two times longer, cause the traceback check will missed the data (which trown before)
sorry that i mistaked, i've been ported the needleman into c sharp..
but it takes error when i use it cause my array data is 16thousand char long,
...Leave a comment:
-
@chbinder
yupz, it said some missing object etc...bla bla bla
@jkmyoung
i couldn't understand what you mean, (cause i'm so dumb --_--)
after i've googling, i found the more nice and faster algorithm,
"lazy DPA"
i think,
- needleman or other standard dpa is taking memory and times too much
- hirchberg is fine, but it ate so much time, cause it does double checking
...Leave a comment:
-
owh yes.. :D
but the source cannot be tested (run) :(
i'm using vc# 2008 express,, hwaLeave a comment:
-
@ChBinder
it can't be downloaded >.<
@jkmyoung
oh dear i've create the programs with needleman-wutsch but it takes so much memory :(
and i've found the hirschberg algo. but i didn't understand the algo :(Leave a comment:
-
Hirschberg algorithm
somebody have a tried/implemented Hirschberg Algorithm to c#?
i need it :(
to make the program compare the two string and tell where the array index that the different,
thx u -
owh my...
i been worked at levenshtein algo in weeks..
and i got nothing! T.T
yesterday i've found what i'm exactly want!
Needleman–Wunsc h algorithm
i been trying to see the naligner source code too, but i don't understand, how stupid i am T.T
anyone can help me to write this algo in c#, so i can insert the conditional if when insertion/deletion/subs happened,...ple ase, thx uLeave a comment:
-
thx a lot to the responses
i've found the algorithm!
what i need is just "levensthei n distance"
:D
now i'm trying on it..
hope i can :pLeave a comment:
-
thx u :D
i'll tryLeave a comment:
-
openfile dialog with folder and file filter for automatic processing
hi everybody, i'm a totally newbie in c#, i've create a little program just to read the .txt file
But how if i want to make a simple text reader takes a file from the folder using the same openfile dialog??
the components are :- open button -> openfile dialog
- ok button -> execute
- textbox -> display output
i want that the openfile dialog filter not only text file | *.txt but also can select... -
no not like this dude..
insertion is the insertion data to array1 so the array1 will changed
eg:
array1 : abcde < 5 char
array2 : abcfde < 6 char
for deletion:
array1 : abcde < 5 char
array2 : abde < 4 char, d deleted
so substitution will executed after the lenght of both array are same..
here is a insertion and subt case:
array1...Leave a comment:
-
my mean is not prefer insertion over deletion..
at your example, if i prefer deletion over insertion, the array1 lenght will changed :)
the algo have not changed the array1 but array2, cause array1 act as standard, so the array2 have to matched with array1
at my algo, i make the 'fragmen' to compare
cause the real array can up to thousands,
this algo will create a fragments with 13char (array) for...Leave a comment:
-
@dheerajjoshim
hmm, my algo is just conditional if, which prior to insertion/deletion then substitution..
@jkmyoung
owh i cannot commented the code well, my english was bad, so i can't descripting it fine :(
at your example, it will insertion of an a, then a deletion of a n
because the array 1 is a standard which to be fixed (may not changed or reassembly)
thx a lot everybody :)Leave a comment:
-
yupz, my algorithm do..
it compare the array length to find out the insertion/deletion
after the array length are the same, continue to substitution compare..
but my algorithm have some error on some data..
can somebody suggest the effective algorithm?? please
thank you.. :)Leave a comment:
-
i don't know the error mechanism,
this algorithm results the wrong analyze output..
here is the code (in C#) but i want to porting it to C++
...Code:/* here is the fragment of my program (abz) the program kindly array comparer */ public void algoritma(string dt, string ds, ref string dm, int n, int m, int array2_counts, int array1_counts, string filename) { // algorithmLeave a comment:
No activity results to display
Leave a comment: