Description: The design and implementation of mlcss algorithm based on dominant point in large data application, three strings are designed in the program to find the longest common subsequence between them. Compared with the traditional dynamic programming method, the idea of dominant point is more efficient.
To Search:
File list (Check if you may need any files):
婧愪唬鐮?
婧愪唬鐮?dmlcs_Change
婧愪唬鐮?dmlcs_Change\Debug
婧愪唬鐮?dmlcs_Change\Debug\dmlcs.exe
婧愪唬鐮?dmlcs_Change\Debug\dmlcs.ilk
婧愪唬鐮?dmlcs_Change\Debug\dmlcs.pdb
婧愪唬鐮?dmlcs_Change\dmlcs
婧愪唬鐮?dmlcs_Change\dmlcs.sdf
婧愪唬鐮?dmlcs_Change\dmlcs.sln
婧愪唬鐮?dmlcs_Change\dmlcs.v12.suo
婧愪唬鐮?dmlcs_Change\dmlcs\1.txt
婧愪唬鐮?dmlcs_Change\dmlcs\Debug
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.log
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.tlog\CL.read.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.tlog\CL.write.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.tlog\dmlcs.lastbuildstate
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.tlog\link.read.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\dmlcs.tlog\link.write.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\mlcscpp.obj
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\vc120.idb
婧愪唬鐮?dmlcs_Change\dmlcs\Debug\vc120.pdb
婧愪唬鐮?dmlcs_Change\dmlcs\dmlcs.vcxproj
婧愪唬鐮?dmlcs_Change\dmlcs\dmlcs.vcxproj.filters
婧愪唬鐮?dmlcs_Change\dmlcs\mlcscpp.cpp
婧愪唬鐮?dmlcs_Change\dmlcs\Release
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.log
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.tlog\cl.read.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.tlog\cl.write.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.tlog\dmlcs.lastbuildstate
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.tlog\link.read.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Release\dmlcs.tlog\link.write.1.tlog
婧愪唬鐮?dmlcs_Change\dmlcs\Release\mlcscpp.obj
婧愪唬鐮?dmlcs_Change\dmlcs\Release\vc120.pdb
婧愪唬鐮?dmlcs_Change\Release
婧愪唬鐮?dmlcs_Change\Release\dmlcs.exe
婧愪唬鐮?dmlcs_Change\Release\dmlcs.pdb
Download