Tiskin, Alexander (2009) Periodic string comparison. In: 20th Annual Symposium on Combinatorial Pattern Matching, Lille, France, June 22-24, 2009. Published in: Lecture Notes in Computer Science, Vol.5577 pp. 193-206.

Full text not available from this repository.

Abstract

In our previous work, we introduced the concept of semi-local 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:	Conference Item (Paper)
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
Journal or Publication Title:	Lecture Notes in Computer Science
Publisher:	Springer
ISBN:	978-3-642-02440-5
ISSN:	0302-9743
Editor:	Kucherov, G and Ukkonen, E
Date:	2009
Volume:	Vol.5577
Number of Pages:	14
Page Range:	pp. 193-206
Identification Number:	10.1007/978-3-642-02441-2_18
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Conference Paper Type:	Paper
Title of Event:	20th Annual Symposium on Combinatorial Pattern Matching
Type of Event:	Conference
Location of Event:	Lille, France
Date(s) of Event:	June 22-24, 2009
URI:	http://wrap.warwick.ac.uk/id/eprint/17038

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item