| Creator |
|
|
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
One of the most important ideas in data mining is alignment of two strings. This idea is based on a distance on strings and the most popular and simple one is the edit distance. For two strings of len...gths m and n, the alignment and the edit distance is computed in O(mn) time by dynamic programming approach. Bit-parallelism can speed-up the computation of the edit distance w times, where w is the word size of a computer, however this parallelism can not be applied straightforwardly to computing the alignment. This paper proposes a bit-parallel algorithm to compute all the possible alignments.show more
|
Export Mendeley
YBEM06