Tiskin, Alexander (2006) All semi-local longest common subsequences in subquadratic time. In: International Computer Science Symposium in Russia (CSR 2006), Steklov Inst Math, St Petersburg, RUSSIA, JUN 08-12, 2006. Published in: COMPUTER SCIENCE - THEORY AND APPLICATIONS, Vol.3967 pp. 352-363.

Full text not available from this repository.

Abstract

For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, we define a generalisation, called "the all semi-local LCS problem", where each string is compared against all substrings of the other string, and all prefixes of each string are compared against all suffixes of the other string. An explicit representation of the output lengths is of size Theta((m+n)(2)). We show that the output can be represented implicitly by a geometric data structure of size O(m + n), allowing efficient queries of the individual output lengths. The currently best all string-substring LCS algorithm by Alves et al. can be adapted to produce the output in this form. We also develop the first all semi-local LCS algorithm, running in time o(mn) when m and n are reasonably close. Compared to a number of previous results, our approach presents an improvement in algorithm functionality, output representation efficiency, and/or 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:	COMPUTER SCIENCE - THEORY AND APPLICATIONS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-34166-8
ISSN:	0302-9743
Editor:	Grigoriev, D and Harrison, J and Hirsch, EA
Date:	2006
Volume:	Vol.3967
Number of Pages:	12
Page Range:	pp. 352-363
Identification Number:	10.1007/11753728_36
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Conference Paper Type:	Paper
Title of Event:	International Computer Science Symposium in Russia (CSR 2006)
Type of Event:	Conference
Location of Event:	Steklov Inst Math, St Petersburg, RUSSIA
Date(s) of Event:	JUN 08-12, 2006
URI:	http://wrap.warwick.ac.uk/id/eprint/33317

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item