Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

8-1982

Volume

42

Issue

4

Start Page

731

Last Page

737

DOI

10.1137/0142051

Abstract

Let $( x_1 ,x_2 , \cdots x_n )$ and $( x'_1 ,x'_2 , \cdots x'_n , )$ be two strings from an alphabet $mathcal{A}$, and let $L_n $ denote their longest common subsequence. The probabilistic behavior of $L_n $ is studied under various probability models for the x’s and $x'$’s.

Included in

Mathematics Commons

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.