Bounding the expected length of longest common subsequences and forests

dc.contributor.author	Scheihing, R.
dc.contributor.author	Navarro, G.
dc.contributor.author	Gavaldà Mestre, Ricard
dc.contributor.author	Baeza-Yates, R.
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-03-16T17:30:22Z
dc.date.available	2016-03-16T17:30:22Z
dc.date.issued	1998-09-01
dc.identifier.uri	http://hdl.handle.net/2117/84548
dc.description.abstract	We present improvements to two techniques to find lower and upper bounds for the expected length of longest common subsequences and forests of two random sequences of the same length, over a fixed size, uniformly distributed alphabet. We emphasize the power of the methods used, which are Markov chains and Kolmogorov complexity. As a corollary, we obtain some new lower and upper bounds for the problems addressed as well as some new exact results for short sequences.
dc.format.extent	19 p.
dc.language.iso	eng
dc.relation.ispartofseries	LSI-98-50-R
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.other	Bounds
dc.subject.other	Expected length
dc.subject.other	Longest common subsequence
dc.subject.other	LCS
dc.title	Bounding the expected length of longest common subsequences and forests
dc.type	External research report
dc.rights.access	Open Access
local.identifier.drac	1893828
dc.description.version	Postprint (published version)
local.personalitzacitacio	true

UPCommons. Portal del coneixement obert de la UPC