Name
Abstract | ||
|---|---|---|
Pattern matching with wildcards is a complex problem and this problem has wide potential application in text search, biological sequences and information security etc. We propose a new algorithm called Quicksearch, for pattern matching with wildcards and length constraints based on key character location and subspace partition. This new algorithm increases by 40%-60% searching efficiency in comparison with SAIL when characters of pattern P in text T are unevenly distributed. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/IRI.2009.5211545 | IRI |
Keywords | Field | DocType |
algorithms,patterns,information security,data mining,pattern matching,wildcards,efficiency,dna,decision support systems,text analysis,algorithm design and analysis | Data mining,Algorithm design,Wildcard character,Subspace topology,Pattern recognition,Computer science,Full text search,Information security,Theoretical computer science,Artificial intelligence,Partition (number theory),Pattern matching | Conference |
Volume | Issue | Citations |
null | null | 4 |
PageRank | References | Authors |
0.44 | 8 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ying-Ling Liu | 1 | 14 | 2.29 |
| Xindong Wu | 2 | 8830 | 503.63 |
| Xuegang Hu | 3 | 442 | 44.50 |
| Jun Gao | 4 | 43 | 7.41 |
| Gong-Qing Wu | 5 | 136 | 13.07 |
| Haiping Wang | 6 | 8 | 3.54 |
| Xiao-Li Hong | 7 | 13 | 1.60 |