About: Chvátal–Sankoff constants

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Chvátal–Sankoff constants Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FChvátal%E2%80%93Sankoff_constants

In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings. Although the existence of these constants has been proven, their exact values are unknown. They are named after Václav Chvátal and David Sankoff, who began investigating them in the mid-1970s.

Attributes	Values
rdfs:label	Chvátal–Sankoff constants (en)
rdfs:comment	In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings. Although the existence of these constants has been proven, their exact values are unknown. They are named after Václav Chvátal and David Sankoff, who began investigating them in the mid-1970s. (en)
dcterms:subject	Mathematical constants Probability theory Problems on strings
Wikipage page ID	44374551 (xsd:integer)
Wikipage revision ID	1122834557 (xsd:integer)
Link from a Wikipage to another Wikipage	Proportionality (mathematics) Method of Four Russians David Sankoff Deterministic finite automaton DNA J. Michael Steele Standard deviation Concatenation Mathematical constant Mathematics Geology Limit (mathematics) Computer science Data comparison String (computer science) Mathematical constants Probability theory Václav Chvátal Dynamic programming Evolutionary tree Expected value Problems on strings Random variable Revision control Rosalind (education) Supremum Edit distance Tracy–Widom distribution Polynomial time Michael Fekete Markov model Uniform distribution (discrete) Superadditivity Stratigraphy Protein sequence Longest common subsequence
sameAs	Chvátal–Sankoff constants Chvátal–Sankoff constants Chvátal–Sankoff constants
dbp:wikiPageUsesTemplate	dbt:Harvtxt dbt:Reflist dbt:Short_description
has abstract	In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings. Although the existence of these constants has been proven, their exact values are unknown. They are named after Václav Chvátal and David Sankoff, who began investigating them in the mid-1970s. There is one Chvátal–Sankoff constant for each positive integer k, where k is the number of characters in the alphabet from which the random strings are drawn. The sequence of these numbers grows inversely proportionally to the square root of k. However, some authors write "the Chvátal–Sankoff constant" to refer to , the constant defined in this way for the binary alphabet. (en)
prov:wasDerivedFrom	wikipedia-en:Chvátal–Sankoff_constants?oldid=1122834557&ns=0
page length (characters) of wiki page	13036 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Chvátal–Sankoff_constants
is Link from a Wikipage to another Wikipage of	David Sankoff List of mathematical constants Chvatal-Sankoff constants Chvátal-Sankoff constant Václav Chvátal Chvatal–Sankoff constants Chvátal-Sankoff constants Longest common subsequence problem Chvátal–Sankoff constant
is Wikipage redirect of	Chvatal-Sankoff constants Chvátal-Sankoff constant Chvatal–Sankoff constants Chvátal-Sankoff constants Chvátal–Sankoff constant
is known for of	Václav Chvátal
is known for of	Václav Chvátal
is foaf:primaryTopic of	wikipedia-en:Chvátal–Sankoff_constants

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 46 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software