Name
Abstract | ||
|---|---|---|
In our previous work, we introduced the concept of semilocal string comparison, and developed for it an efficient method called
the seaweed algorithm. In the current paper, we introduce its extension, called the periodic seaweed algorithm. The new algorithm
allows efficient exploitation of the periodic structure in one of the input strings. By application of the periodic seaweed
algorithm, we obtain new algorithms for the tandem LCS problem and the tandem cyclic alignment problem, improving on existing
algorithms in running time.
|
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02441-2_18 | Combinatorial Pattern Matching |
Keywords | Field | DocType |
periodic string comparison,current paper,efficient exploitation,seaweed algorithm,tandem cyclic alignment problem,tandem lcs problem,input string,efficient method,new algorithm,periodic structure,periodic seaweed algorithm | Discrete mathematics,Tandem,Computer science,Algorithm,Periodic graph (geometry) | Conference |
Volume | ISSN | Citations |
5577 | 0302-9743 | 4 |
PageRank | References | Authors |
0.39 | 13 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Tiskin | 1 | 220 | 15.50 |
| Coventry CV | 2 | 22 | 2.87 |