Buscar
Mostrando ítems 1-10 de 5356
Um estudo avan??ado do problema da Maior Subsequ??ncia Comum
(Universidade Federal da BahiaInstituto de Matem??ticaDepartamento de Ci??ncia da Computa????oUFBAbrasil, 2016-08-31)
Repetition-free longest common subsequence of random sequences
(Elsevier, 2016)
A repetition-free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols ...
An all-substrings common subsequence algorithm
(ELSEVIER SCIENCE BV, 2008)
Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a ...
Repetition-free longest common subsequence
(ELSEVIER SCIENCE BV, 2010)
We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and ...
Thermodynamical approach to the longest common subsequence problem
(SpringerNew YorkEUA, 2008)
Associations between mental disorders and subsequent onset of hypertension
(Elsevier, 2014)
Previous work has suggested significant associations between various psychological symptoms (e.g., depression, anxiety, anger, alcohol abuse) and hypertension. However, the presence and extent of associations between common ...
Using string matching to detect video transitions
(SpringerNew YorkEUA, 2007)
Expected length of the longest common subsequence for large alphabets
(ACADEMIC PRESS, 2005)
Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
(Cambridge University Press, 2015)
To Philippe Flajolet, a mathematical discontinuity, a tamer of singularities. A two-row array of integers an = a1 a2 ... an b1 b2 ... bn is said to be in lexicographic order if its columns are in lexicographic order (where ...
Expected length of the longest common subsequence for large alphabets
(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2005-11-10)
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that E[L]/n converges to a constant ...