Bounding the expected length of longest common subsequences and forests
type: Item
instance of: scholarly article
title: Bounding the expected length of longest common subsequences and forests
zbMATH Open document ID: 0934.68043
published in: Theory of Computing Systems
publication date: 1999-06-28T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1309894
zbMATH Keywords: two random sequences
zbMATH Keywords: Markov chains
author: Ricardo Baeza-Yates
author: Ricard Gavaldà
author: Gonzalo Navarro
author: Rodrigo Scheihing
MaRDI profile type: Publication
full work available at URL: s002240000125
OpenAlex ID: W1988684690
DOI: 10.1007/S002240000125
description: scientific article; zbMATH DE number 1309894