Name
Abstract | ||
|---|---|---|
Abstract A new,methodology for extracting all frequent sequential patterns with minimum variable-length wildcard regions from,sequence databases in order to extract candidates of a motif from amino acid sequences is proposed. A scope database defined by the k-length pattern consists of not only the projected database including the start position of a scan but also the range of the scan and occurrences corresponding to evidence for the pattern. The scope database makes it possible to avoid the construction of the variable-length wildcard region that is too large to explain occurrences corresponding to evidence for each (k+1)-length pattern. Moreover, redundancy is also eliminated for the set of solutions using the scope database. Furthermore, the prototype has been applied to the evaluation of a dataset that includes the Leucine Zipper motif. Our method resulted in a high capability to extract non-redundant sequential patterns including minimum,variable-wildcard regions. Keywords: sequential pattern extraction, variable |
Year | Venue | Keywords |
|---|---|---|
2006 | PDPTA | leucine zipper,amino acid sequence |
Field | DocType | Citations |
Wildcard,Computer science,Parallel computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomoyuki Kato | 1 | 80 | 8.59 |
| H. Kitakami | 2 | 94 | 49.68 |
| Makoto Takaki | 3 | 11 | 2.76 |
| Keiichi Tamura | 4 | 37 | 13.86 |
| Yasuma Mori | 5 | 21 | 9.89 |
| Susumu Kuroki | 6 | 23 | 98.05 |