The Library
Periodic string comparison
Tools
Tools
Tools
Tiskin, Alexander (2009) Periodic string comparison. In: Combinatorial Pattern Matching. Lecture Notes in Computer Science (5577). Springer Verlag, pp. 193-206. ISBN 9783642024405
![[img]](http://wrap.warwick.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
fulltext8.pdf - Published Version Restricted to Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader Download (286Kb) |
Official URL: http://dx.doi.org/10.1007/978-3-642-02441-2_18
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
| Item Type: | Book Item | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Divisions: | Faculty of Science > Computer Science | ||||
| Series Name: | Lecture Notes in Computer Science | ||||
| Publisher: | Springer Verlag | ||||
| ISBN: | 9783642024405 | ||||
| Book Title: | Combinatorial Pattern Matching | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Number: | 5577 | ||||
| Page Range: | pp. 193-206 | ||||
| Identification Number: | 10.1007/978-3-642-02441-2_18 | ||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| URI: | http://wrap.warwick.ac.uk/id/eprint/47560 |
Request changes or add full text files to a record
Actions (login required)
 |
View Item |
