DocumentCode :
2124603
Title :
An algorithm to find the largest adjacent repeated pattern based on Suffix Tree
Author :
Yuan-Chun, Xu ; Yuan, Tian ; Yi-Lai, Zhang ; De-Xian, Guo
Author_Institution :
Sch. of Inf. Eng., JDZ Ceramic Inst., Jingdezhen, China
fYear :
2012
fDate :
21-23 April 2012
Firstpage :
2353
Lastpage :
2356
Abstract :
This paper analyses the features of the adjacent repeated patterns with Suffix Tree, and proposes an algorithm based on Suffix Tree through constructing Suffix Tree again to find the largest adjacent repeated pattern. The comparable and analyzable experiment shows that this algorithm can find the largest repeated patterns which are effective and true.
Keywords :
trees (mathematics); largest adjacent repeated pattern; suffix tree; Algorithm design and analysis; Ceramics; HTML; Ontologies; Pattern matching; Switches; XML; Suffix Tree; the largest adjacent repeated pattern;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on
Conference_Location :
Yichang
Print_ISBN :
978-1-4577-1414-6
Type :
conf
DOI :
10.1109/CECNet.2012.6201906
Filename :
6201906
Link To Document :
بازگشت