The Library
UPPER-BOUNDS FOR THE EXPECTED LENGTH OF A LONGEST COMMON SUBSEQUENCE OF 2 BINARY SEQUENCES
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.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
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 | ||||
Official Date: | July 1995 | ||||
Dates: |
|
||||
Volume: | 6 | ||||
Number: | 4 | ||||
Number of Pages: | 10 | ||||
Page Range: | pp. 449-458 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |