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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1999-2013
01219992013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
  • Tracey L. Weldon
  • 2013
Many researchers have investigated the copula for possible links between African American Vernacular English (aave) and Atlantic… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2011
2011
In my presentation I will discuss how sociolinguistic corpora can be compiled so as to document and maximize access to the… (More)
Is this relevant?
2011
2011
Since at least the mid 19th century, the inflected future (IF) in affirmative clauses has steadily declined in Québécois French… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
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… (More)
  • table 1
  • table 2
Is this relevant?
2007
2007
An essential problem in music information retrieval is to determine the similarity between two given melodies; there are several… (More)
  • table 1
  • figure 1
  • table 2
Is this relevant?
2006
2006
The existence of variability, i.e., when multiple surface forms correspond to a single underlying representation, is a… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2002
2002
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common subsequence (LCS) problem… (More)
  • table 1
Is this relevant?
2001
2001
The longest common subsequence problem is a long studied prototype of pattern matching problems. In spite of the effort dedicated… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2000
2000
The condition that the independence number of a graph is less than or equal to its connectivity is called the Chvátal-Erdös… (More)
Is this relevant?
Review
1999
Review
1999
  • P E N E L O P E E C K, S A L L Y M C C O N N E L L-G I N E T
  • 1999
Gendered linguistic practices emerge as people engage in social practices that construct them not only as girls or boys, women or… (More)
Is this relevant?