Skip to search formSkip to main contentSkip to account menu

Chvátal–Sankoff constants

Known as: Chvatal-Sankoff constants, Chvatal–Sankoff constants, Chvátal-Sankoff constants 
In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We analyze the general version of the classic guessing game Mastermind with n positions and k colors. Since the case k ≤ n1−e, e… 
2012
2012
Les variations dans le lieu et le mode d’articulation du R constituent un probleme classique de la phonologie du francais. Les… 
2009
2009
It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over… 
2009
2009
Objective: To understand the defenses employed by women suffering from Turner syndrome (TS) and different ways of dealing with… 
2007
2007
The Genome Halving Problem, motivated by the whole genome duplication events in molecular evolution, was solved by El-Mabrouk and… 
2006
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the traveling salesman problem, defined in terms… 
2002
2002
0. Introduction Numerous studies examining the regularity of occurrence of types of codeswitches in bilingual production data… 
Highly Cited
1999
Highly Cited
1999
Gendered linguistic practices emerge as people engage in social practices that construct them not only as girls or boys, women or… 
Review
1999
Review
1999
OF THE DISSERTATION Concept-Learning in the Absence of Counter-Examples: An Autoassociation-Based Approach to Classi cation by… 
1994
1994
: This paper investigates mixing Arabic and English in science lectures. The phenomenon is examined mainly with reference to…