Results 11 - 20 of 11,085

LONGEST COMMON SUBSEQUENCES

by Author(s) Vacláv Chvátal, David Sankoff, Vaclav Chvatal, David Sankoff, Universitd De Montreal
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at. ..."
Abstract - Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at.

The Longest Restricted Common Subsequence Problem

by Gabriela Andrejkova , 1998
"... An efficient algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLCS) of two partitioned strings with the restricted using of elements. The above algorithm has an application in solution of the Set-Set Longest Common Subsequence Problem (SSLCS). It is shown the tran ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
An efficient algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLCS) of two partitioned strings with the restricted using of elements. The above algorithm has an application in solution of the Set-Set Longest Common Subsequence Problem (SSLCS). It is shown

Expected Length of Longest Common Subsequences

by Vladimír Dancík
"... Contents 1 Introduction 1 2 Notation and preliminaries 4 2.1 Notation and basic definitions : : : : : : : : : : : : : : : : : : 4 2.2 Longest common subsequences : : : : : : : : : : : : : : : : : : 7 2.3 Computing longest common subsequences : : : : : : : : : : : 10 2.4 Expected length of longest c ..."
Abstract - Cited by 22 (2 self) - Add to MetaCart
Contents 1 Introduction 1 2 Notation and preliminaries 4 2.1 Notation and basic definitions : : : : : : : : : : : : : : : : : : 4 2.2 Longest common subsequences : : : : : : : : : : : : : : : : : : 7 2.3 Computing longest common subsequences : : : : : : : : : : : 10 2.4 Expected length of longest

Repetition-free longest common subsequence

by Said S. Adi, Marília D. V, Braga Cristina, G. Fernandes, Carlos E. Ferreira, Fábio Viduani, Martinez Marie-france Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
"... We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms. Keywords: Longest ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms. Keywords: Longest

STANDARD DEVIATION OF THE LONGEST COMMON SUBSEQUENCE

by Jüri Lember, Heinrich Matzinger , 907
"... Let Ln be the length of the longest common subsequence of two independent i.i.d. sequences of Bernoulli variables of length n. We prove that the order of the standard deviation of Ln is √ n, provided the parameter of the Bernoulli variables is small enough. This validates Waterman’s conjecture in th ..."
Abstract - Cited by 12 (8 self) - Add to MetaCart
Let Ln be the length of the longest common subsequence of two independent i.i.d. sequences of Bernoulli variables of length n. We prove that the order of the standard deviation of Ln is √ n, provided the parameter of the Bernoulli variables is small enough. This validates Waterman’s conjecture

Common Subsequences and Supersequences and Their Expected Length

by Vlado Dancik , 1995
"... . Let f(n; k; l) be the expected length of a longest common subsequence of l sequences of length n over an alphabet of size k. It is known that there are constants fl (l) k such that f(n; k; l) ! fl (l) k n, we show that fl (l) k = \Theta(k 1=l\Gamma1 ). Bounds for the corresponding constant ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
. Let f(n; k; l) be the expected length of a longest common subsequence of l sequences of length n over an alphabet of size k. It is known that there are constants fl (l) k such that f(n; k; l) ! fl (l) k n, we show that fl (l) k = \Theta(k 1=l\Gamma1 ). Bounds for the corresponding

Bounds on the number of longest common subsequences

by Ronald I. Greenberg
"... This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common subsequences. That is, we bound the running time as a function of input size for algorithms with time essentially proportional to the output size. This paper consider ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common subsequences. That is, we bound the running time as a function of input size for algorithms with time essentially proportional to the output size. This paper

Bounds on the complexity of the longest common subsequence problem

by A V. Aho, D S. Hirschberg, J D. Ullman - Journal of the ACM , 1976
"... ABSTRACT The problem of finding a longest common subsequence of two strings is discussed This problem arises in data processing applications such as comparing two files and in genetic applications such as studying molecular evolution The ddlqculty of computing a longest common subsequence of two str ..."
Abstract - Cited by 77 (1 self) - Add to MetaCart
ABSTRACT The problem of finding a longest common subsequence of two strings is discussed This problem arises in data processing applications such as comparing two files and in genetic applications such as studying molecular evolution The ddlqculty of computing a longest common subsequence of two

Longest Common Subsequence as Private Search

by Mark Gondree, Payman Mohassel
"... At STOC 2006 and CRYPTO 2007, Beimel et al. introduced a set of privacy requirements for algorithms that solve search problems. In this paper, we consider the longest common subsequence (LCS) problem as a private search problem, where the task is to find a string of (or embedding corresponding to) a ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
At STOC 2006 and CRYPTO 2007, Beimel et al. introduced a set of privacy requirements for algorithms that solve search problems. In this paper, we consider the longest common subsequence (LCS) problem as a private search problem, where the task is to find a string of (or embedding corresponding to

Clickstream Clustering Using Weighted Longest Common Subsequences

by Arindam Banerjee, Joydeep Ghosh - In Proceedings of the Web Mining Workshop at the 1st SIAM Conference on Data Mining , 2001
"... Categorizing visitors based on their interactions with a website is a key problem in web usage mining. The clickstreams generated by various users often follow distinct patterns, the knowledge of which may help in providing customized content. In this paper, we propose a novel and effective algorith ..."
Abstract - Cited by 78 (4 self) - Add to MetaCart
algorithm for clustering webusers based on a function of the longest common subsequence of their clickstreams that takes into account both the trajectory taken through a website and the time spent at each page. Results are presented on weblogs of www.sulekha.com to illustrate the techniques.
Results 11 - 20 of 11,085