搜索资源列表
introduction-to-algorithms-code
- 1st：快排序算法及优化(7.4-5)； 2nd：红黑树插入算法； 3rd：区间树上的重叠区间查找算法； 4th：求最近点对算法； 5th：最长公共子序列(LCS)算法； 6th：Huffman编码问题； -introduction to algorithms code
LCS
- （1） 掌握多模式匹配方法 （2） 掌握基于双数组-自动机原理的多模式匹配原理 -(1) master multi-mode matching method (2) based on the dual control array- automatic machine principle of multi-mode matching principle
LCString
- 求两个字符串的公共子序列LCS，总共有三种可选的方法，并附带算法的性能分析-Seek common subsequence of two strings LCS, a total of three alternative methods, and comes algorithm performance analysis
7_to_1-LVDS-dispaly-from-FLASH
- 该代码是基于verilog 实现的代码，可以用于对接受1080P的LVDS视频数据并处理后显示到各种规格的LCD屏幕上，且支持从FLASH中读取BMP的图片数据并实时显示到LCS屏幕-The code is based on the code verilog achieve, it can be used for receiving LVDS 1080P video and data processing displayed on a variety of LCD screen, and sup
lcs
- 在一组序列中，找到最长公共子序列，虽然序列不是唯一的，但是是根据最长公共子序列的长度来确定。-In the Java code to achieve the longest common subsequence, and algorithm of the ideology of the book
LCS
- 最长公共子序列的算法。值得借鉴与学习。通俗易懂-Longest common subsequence algorithm. Worth learning and learning. Straightaway
2
- 2． Longest Common Subsequence (LCS). The following are some instances. a) X: xzyzzyx Y: zxyyzxz b) X: ALLAAQANKESSSESFISRLLAIVAD Y: KLQKKLAETEKRCTLLAAQANKENSNESFISRLLAIVAG 求最长公共子序列 -2． Longest Common Subsequence (LCS). The following are
LCS
- 求解最长公共子序列，要求输入10个字符 ，用C语言(Solving the longest common subsequence, asking for 10 characters, using the C language)
源代码
- 大数据应用中基于支配点的mlcss算法设计与实现，程序中设计了三条字符串，查找他们之间的最长公共子序列。相对于传统的动态规划法，基于支配点思想具有更加高效的效率。(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
LCS
- 最长公共子序列算法，使用图形化方式将算法的实现过程展示了出来，C++语言(show the Longest Common Subsequence algoithm by graphic using C++ language)
weflection
- LCS,即最常公共子序列的的C语言解法,prepare_for_backdate(char,char,int,int)函数()
suxpgil
- LCS,即最常公共子序列的的C语言解法,prepare_for_backdate(char,char,int,int)函数()