DocumentCode
3539707
Title
Pattern matching algorithm based on dynamic programming
Author
Lv, Chaoqi ; Wang, Weiming ; Gao, Ming
Author_Institution
Coll. of Inf. & Electron. Eng., Zhejiang GongShang Univ., Hangzhou, China
fYear
2009
fDate
4-6 Aug. 2009
Firstpage
852
Lastpage
854
Abstract
The paper had put the idea about the principle of optimizing dynamic programming to the log pattern matching algorithm, made the best dynamic matching algorithm, that is, by matching local sub-problems to solve, in view of the number of different rules, the matching algorithm will find the best combination to achieve the overall strategy of the optimal solution.
Keywords
dynamic programming; pattern matching; dynamic matching algorithm; dynamic programming; local subproblems; log pattern matching algorithm; optimal solution; Dynamic programming; Heuristic algorithms; Pattern matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Applications of Digital Information and Web Technologies, 2009. ICADIWT '09. Second International Conference on the
Conference_Location
London
Print_ISBN
978-1-4244-4456-4
Electronic_ISBN
978-1-4244-4457-1
Type
conf
DOI
10.1109/ICADIWT.2009.5273912
Filename
5273912
Link To Document