Open AccessLong Common Subsequences and the Proximity of Two Random Strings
Author(s) -
Michael J. Steele
Publication year - 1982
Publication title -
siam journal on applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.954
H-Index - 99
eISSN - 1095-712X
pISSN - 0036-1399
DOI - 10.1137/0142051
Subject(s) - longest common subsequence problem , alphabet , combinatorics , subsequence , mathematics , probabilistic logic , longest increasing subsequence , discrete mathematics , statistics , mathematical analysis , philosophy , linguistics , bounded function
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom