The Library
UPPER-BOUNDS FOR THE EXPECTED LENGTH OF A LONGEST COMMON SUBSEQUENCE OF 2 BINARY SEQUENCES
Tools
Tools
Tools
UNSPECIFIED (1995) UPPER-BOUNDS FOR THE EXPECTED LENGTH OF A LONGEST COMMON SUBSEQUENCE OF 2 BINARY SEQUENCES. RANDOM STRUCTURES & ALGORITHMS, 6 (4). pp. 449-458. ISSN 1042-9832
Full text not available from this repository.Abstract
Let f(n) be the expected length of a longest common subsequence of two random binary sequences of length n. It is known that the limit gamma = lim(n-->infinity)n(-1)f(n) exists. Improved upper bounds for gamma are given using a new method. (C) 1995 John Wiley & Sons, Inc.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
| Journal or Publication Title: | RANDOM STRUCTURES & ALGORITHMS |
| Publisher: | JOHN WILEY & SONS LTD |
| ISSN: | 1042-9832 |
| Date: | July 1995 |
| Volume: | 6 |
| Number: | 4 |
| Number of Pages: | 10 |
| Page Range: | pp. 449-458 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/19723 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
